Common sorting algorithms

Question

Accepted Answer

Common sorting algorithms include Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Quick Sort, and Heap Sort.

Bubble Sort - repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order
Selection Sort - repeatedly finds the minimum element from the unsorted part and swaps it with the first unsorted element
Insertion Sort - builds the final sorted array one item at a time by inserting each element into its correct position
Merge Sort - divides the array into two halves, sorts them, and then merges the sorted halves
Quick Sort - picks an element as pivot and partitions the array around the pivot
Heap Sort - builds a max heap from the array and repeatedly extracts the maximum element

Accepted Answer

Common sorting algorithms include Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Quick Sort, and Heap Sort.
Bubble Sort - repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order

Selection Sort - repeatedly finds the minimum element from the unsorted part and swaps it with the first unsorted element

Insertion Sort - builds the final sorted array one item at a time by inserting each element into its correct position

Merge Sort - divides the array into two halves, sorts them, and then merges the sorted halves

Quick Sort - picks an element as pivot and partitions the array around the pivot

Heap Sort - builds a max heap from the array and repeatedly extracts the maximum element

Reply

Help your peers!

Share your answer

Common sorting algorithms

Top Tech Mahindra Telecaller interview questions & answers

Popular interview questions of Telecaller

Top HR questions asked in Tech Mahindra Telecaller