Heap sort is a Heap data structure based comparison sorting technique where we first find the maximum element and place the maximum element at the end. We repeat the same process for remaining elements.
In this section we will get in depth knowledge of Sorting Algorithms, including Sorting Algorithms interview questions with solution and Sorting Algorithms based logical problems.
We will also look into time and space complexity of different algorithms and problems based on Sorting.
These Sorting Algorithms based questions with complete explanation and implementation in Java are very helpful in cracking any software engineering interview.
Selection Sort is one of the simplest sorting algorithm, where array is traversed from first element to last element to repeatedly find the minimum element. In this way the array is divided into two sub-arrays sorted and unsorted, in each pass one element is added to sorted array from unsorted array.