File Structures and Algorithms

It is an algorithm which calls itself with smaller inputs and obtains the outputs for the current input by applying simple operaions to the returned value of the smaller input.

It assumes that each of the n elements is an integer in the range 0 to k, for some integer k.

Here, the interval between probes is increased by adding the successive outputs of a polynomial to the starting value given by the original hash computation.

It is defined as a graph with no path and starts and ends at the same vertex.

It is defined as the amount of memory that an algorithm needs.

Here, the storage space allocated to the file can be increased or decreased without recognizing the whole files.

Here, we recursively chop the list into two sublists of almost equal sizes and when we get list of size one, then start sorted combining of lists the reverse order.

Here every level, except possibly the last, is totally filled, and all nodes are as far left as possible.

An adjacency list is implemented as an array of lists with one list of destination nodes for each source node.

Here, rows represent the vertices and columns represent the edge.

It simply tries all possibilities until a satisfactory solution is found.

It is a function that describes the time of an execution of an algorithm based on its input parameters.

Here, the hash functions are describe as h2(key) is not equal to zero and h2 is not equal to h1 where h1 and h2 are first and second hash function.

Comparison sorts can be viewed abstractly in terms of decision trees.

It stores the previous results and uses them to find new ones.