Turn Desktop View Off
by Dinesh Thakur

A class of algorithm that helps to provide very rapid access to data items that can be distinguished by some KEY value, for example a person's name, or a filename. This key value is passed through a HASH FUNCTION which creates from it a number that is used as an index into a HASH TABLE containing pointers to the actual data items.

 
by Dinesh Thakur

An important subclass of lists permits the insertion and deletion of an element to occur only at one end. A linear list of this type is known as ‘stack’.

 
by Dinesh Thakur

Sorting refers to ordering data in an increasing or decreasing fashion according to some linear relationship among the data items.

 
by Dinesh Thakur

The answer depends on what you mean by quickest. For most sorting problems, it just doesn't matter how quick the sort is because it is done infrequently or other operations take significantly more time anyway.

 
by Dinesh Thakur

This sorting technique is named so because of the logic is similar to the bubble in water. When a bubble is formed it is small at the bottom and when it moves up it becomes bigger and bigger i.e. bubbles are in ascending order of their size from the bottom to the top.

 
by Dinesh Thakur

In this sort an element called pivot is identified and that element is fixed in its place by moving all the elements less than that to its left and all the elements greater than that to its right. Since it partitions the element sequence into left, pivot and right it is referred as a sorting by partitioning.

 
by Dinesh Thakur

In heap sort the file to be sorted is interpreted as a binary tree. The sorting technique is implemented using array, which is a sequential representation of binary tree. The positioning of a node is given as follows

 
by Dinesh Thakur

Searching is a process of locating a particular element present in a given set of elements. The element may be a record, a table, or a file.

 
by Dinesh Thakur

In Linear Search the list is searched sequentially and the position is returned if the key element to be searched is available in the list, otherwise -1 is returned. The search in Linear Search starts at the beginning of an array and move to the end, testing for a match at each item.

 
by Dinesh Thakur

In a linear search the search is done over the entire list even if the element to be searched is not available. Some of our improvements work to minimize the cost of traversing the whole data set, but those improvements only cover up what is really a problem with the algorithm.