|Computer Science Contents...............||Data Structures||Electronics......||Networks....||MICRO Processors||Operating Systems|
|Data Strucutres||Linked Lists||Binary Trees||Expression Converstion's||Infix To Postfix||Infix To Prefix||Postfix To Prefix||Postfix To Infix||Postfix Expression Evaluation|
|Home............||Linked List||Binary Trees||Arrays ||Stacks||Queues||Graphs||Searching Methods||Sorting Methods|
|Sorting Methods||Quick Sort||Heap Sort||Selection Sort||Bubble Sort||Radix Sort||Shell Sort|
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.