Computer  Science Contents...............
Data Structures Electronics......Networks....MICRO ProcessorsOperating Systems
Data Strucutres
Linked ListsBinary TreesExpression Converstion'sInfix To PostfixInfix To Prefix Postfix To PrefixPostfix To InfixPostfix Expression Evaluation
Home............
Linked ListBinary TreesArrays
StacksQueuesGraphsSearching MethodsSorting Methods
Sorting MethodsQuick Sort Heap Sort Selection SortBubble SortRadix SortShell Sort
Sorted arrays may be searched efficiently using a binary search. However, wemust have a sorted array to start with. In the next section various ways to sort arrays will be

examined. It turns out that this is computationally expensive, and considerable research has been done to make sorting algorithms as efficient as possible. Linked lists improved the efficiency of insert and delete operations, but searches weresequential and time-consuming. Algorithms exist that do all three operations efficiently, and they will be the discussed in the section on dictionaries. Several algorithms are presented, including insertion sort, shell sort, and quicksort. Sorting by insertion is the simplest method, and doesn’t require any additional storage. Shell sort is a

simple modification that improves performance significantly. Probably the most efficient and popular method is quicksort, and is the method of choice for large arrays.