Indexed Sequential Search: In this searching technique, first of all an index file is created that contains references to a
Tag: Data Structure
Sorting on multiple keys The sorting algorithm may be applied on multiple keys such that if first field contains duplicate
Sorting – Address Calculation Sort (Hashing) In this method a function f is applied to each key. The result of
Sorting – Quick Sort (Partition Exchange Sort) Suppose x be an array, n is the number of elements. Choose an
Sorting – Merge Sort Merging:- Merging is the process of combining two or more sorted files into a third sorted
Sorting – Radix Sort Radix Sort sorts the number in scans equal to the number of digits of maximum number.
Sorting – Straight Selection Sort Begin from the first element, taking i=0 to n-1. Find the minimum number in the
Sorting – General Selection Sort Steps: Fetch the numbers to be sorted in an array. Push these numbers one by
Insertion Sort Sorts a set of records by comparing the next record with all the previous elements. Compare next element
Bubble sort: Two consecutive elements are compared. It sorts the elements in right to left fashion. Thus, (n-i) comparisons are