What are the commanly used sorting algorithm?

Question

Uday Dodiya · Answer

Some of the most common sorting algorithms are: Selection Sort Bubble Sort Insertion Sort Merge Sort Quick Sort Heap Sort Counting Sort Radix Sort Bucket Sort Classification of Sorting Algorithm Sorting algorithms can be categorized based on the following parameters: Based on Number of Swaps or Inversion This is the number of times the algorithm swaps elements to sort the input. Selection Sort requires the minimum number of swaps. Based on Number of Comparisons This is the number of times the algorithm compares elements to sort the input. Using Big-O notation, the sorting algorithm examples listed above require at least O(nlogn) comparisons in the best case and O(n^2) comparisons in the worst case for most of the outputs. Based on Recursion or Non-Recursion Some sorting algorithms, such as Quick Sort , use recursive techniques to sort the input. Other sorting algorithms, such as Selection Sort or Insertion Sort , use non-recursive techniques. Finally, some sorting algorithm, such as Merge Sort , make use of both recursive as well as non-recursive techniques to sort the input. Based on Stability Sorting algorithms are said to be stable if the algorithm maintains the relative order of elements with equal keys. In other words, two equivalent elements remain in the same order in the sorted output as they were in the input. Insertion sort , Merge Sort , and Bubble Sort are stable Heap Sort and Quick Sort are not stable Based on Extra Space Requirement Sorting algorithms are said to be in place if they require a constant O(1) extra space for sorting. Insertion sort and Quick-sort are in place sort as we move the elements about the pivot and do not actually use a separate array which is NOT the case in merge sort where the size of the input must be allocated beforehand to store the output during the sort. Merge Sort is an example of out place sort as it require extra memory space for it’s operations.

Rajanikant Hawaldar · Answer

Bubble Sort: Bubble Sort is the most basic sorting algorithm, and it works by repeatedly swapping adjacent elements if they are out of order. Merge Sort: Merge sort is a sorting technique that uses the divide and conquer strategy. Quicksort: Quicksort is a popular sorting algorithm that performs n log n comparisons on average when sorting an array of n elements. It is a more efficient and faster sorting algorithm. Heap Sort: Heap sort works by visualizing the array elements as a special type of complete binary tree known as a heap. Selection Sort:The selection is a straightforward process of sorting values. In this method, to sort the data in ascending order, the 0th element is compared with all other elements. If the 0th element is found to be greater than the compared element, the two values get interchanged. In this way after the first iteration, the smallest element is placed at 0th position. The technique is repeated until the full array gets sorted.

Anand SA · Answer

THank you