Sorting Types in Data Structure

Question

- What are the different sorting types in data structure? - Which one is more quick? - Examples

Shweta Lodha · Answer

Possible sorting types: Quick Sort Bubble Sort Merge Sort Insertion Sort Selection Sort Heap Sort Radix Sort Bucket Sort And here is the time complexities: Algorithm Best Average Worst Quick Sort Ω(n log(n)) Θ(n log(n)) O(n^2) Bubble Sort Ω(n) Θ(n^2) O(n^2) Merge Sort Ω(n log(n)) Θ(n log(n)) O(n log(n)) Insertion Sort Ω(n) Θ(n^2) O(n^2) Selection Sort Ω(n^2) Θ(n^2) O(n^2) Heap Sort Ω(n log(n)) Θ(n log(n)) O(n log(n)) Radix Sort Ω(nk) Θ(nk) O(nk) Bucket Sort Ω(n+k) Θ(n+k) O(n^2) Original link : Sorting Algorithms - InterviewBit

Rajeesh Menoth · Answer

Hi, 1. What are the different sorting types in data structure? Adaptive sorting algorithms: Bubble Sort Insertion Sort Quick Sort Non-adaptive sorting algorithms: Selection Sort Merge Sort Heap Sort 2. Which one is more quick? Quick Sort Examples: https://medium.com/javarevisited/sorting-algorithms-slowest-to-fastest-a9f0e30937b9

Sagar Lad · Answer

Hi Pranam, YOu can refer this : https://www.google.com/search?q=types+of+sorting+in+data+structure&rlz=1C1GCEA_enNL893NL893&oq=sorting+type+in+data+st&aqs=chrome.1.69i57j0i10i22i30j0i390l3j69i60.4954j0j7&sourceid=chrome&ie=UTF-8

Shweta Lodha · Answer

Which algo is fastest, it can not be said as each and every sorting method has their pros and cons. Based on the situation, one can be used. For example, if efficiency is not an issue, one can use Bubble sort as it's very easy to implement. But if your array is almost sorted then Insertion sort could be your option and goes on.