Heaps and Heap Sort

A demonstration of heaps, heap sort, and a competition with merge-sort. See here a more detailed discussion of the properties of heap sort. Note that the procedures mentioned in the video, “sift-down”, “heapify”, and “sift-up”, may be named differently in different descriptions of heapsort. The implementation is the same though. Links: ——— More details about […]


Selection Sort in C, Java & Python | Sorting Algorithms | Episode – 7 | Data Structures | ABC

Episode-7 | The Selection Sort Algorithm is one of the most frequently asked Sorting Techniques in the placement interview process. Selection sort is a simple sorting algorithm. This sorting algorithm is an in-place comparison-based algorithm and is established on the idea of finding the minimum element(considering ascending order) or maximum element (considering descending order) in […]