Please enable JavaScript.
Coggle requires JavaScript to display documents.
Sorting Techniques (Shell Sort (Birth - March 1, 1924
Death - November 2,…
Sorting Techniques
Shell Sort
Birth - March 1, 1924
Death - November 2, 2015
He acquired his Ph.D. in Mathematics from the University of Cincinnati in 1959.He was known for Shell sorting method.
-
Shell sort was invented in 1959, the shell sort is the most efficient of the O(n²) class of sorting algorithms.
-
-
Heap Sort
-
-
-
It is used for maintaining a particular ordering when you want to extract either minimum or maximum. This is at core of job scheduling.
-
Bucket Sort
-
-
-
-
Bucket sort, or bin sort, is a sorting algorithm that works by distributing the elements of an array into a number of buckets. Each bucket is then sorted individually, either using a different sorting algorithm, or by recursively applying the bucket sorting algorithm.
Bubble Sort
-
It is used in academia to introduce 1st-year computer science students to the concept of a sorting algorithm as it is the simplest sorting technique.
Selection Sort
It is used in sorting on Flash memory, because writes reduce the lifespan of Flash memory.
-
Insertion Sort
Birth - February 20, 1953
-
-
Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. It is much less efficient on large lists than more advanced algorithms.
-
Linear Search
-
-
-
Linear search is usually very simple to implement, and is practical when the list has only a few elements, or when performing a single search in an unordered list.
-
Binary Search
Born : April 22, 1924
Died : May 6, 2009
-
-
-
-
Radix Sort
Born : July 24, 1930
Deid : June 19, 2012
-
-
-
-
Count Sort
Born : July 24, 1930
Deid : June 19, 2012
-
-
Counting and Radix sort are superior when it comes to sorting countable objects, that come from a discrete set of values, such as bounded integers.
-
Merge Sort
Birth : December 28, 1903
Death : February 8, 1957
-
-
Merge Sort is a Divide and Conquer algorithm. It divides input array in two halves, calls itself for the two halves and then merges the two sorted halves. The merge() function is used for merging two halves.
-
Quick Sort
-
-
-
If we have 128 items, there will be average 128*(2) = 256 iterations to sort them all. Not bad if you compare typical selection sort which is 128^128 which is terrible.
-
-
Conclusion:The Quick Sort Is The Best Sorting method as it uses minimum time to sort any elements and less complex.
