Custom Comparators in C++
Custom Comparators are used to compare the members or objects of user-defined containers (class/data structure).
Category: Sorting
Array Manipulation | HackerRank Solution [Hard]
Starting with a 1-indexed array of zeros and a list of operations, for each operation add a value to each the array element between two given indices, inclusive. Once all operations have been performed, return the maximum value in the array.
Heap Data structure | Heap Sort in C++
The Heapsort algorithm uses Heap data structure to sort an array in O(nlogn) time complexity. It starts by calling Build-Max-Heap.
Sorting in Linear Time | Counting Sort, Radix Sort, Bucket Sort
Traditional sorting algorithms have average time complexities of O(n logn), making them efficient for general-purpose sorting.
Common Sorting Algorithms
A sorting algorithm is an algorithm that puts elements of a list into an order. Most frequently we’re required to sort data structures such as arrays, linked lists etc having numerical values. There’re various algorithms to sort a container or a data structure. In this post, we’ll discuss most popular or commonly used algorithms.
Why is Quicksort better than Merge Sort? [Divide & Conquer]
Quicksort is a sorting algorithm whose worst-case running time is O(n^2), for an input of size n. Quicksort, in spite of having worse time complexity than Merge Sort which is O(nlogn), it is a better practical choice for sorting. This is because it is remarkably efficiently on average cases, where its time complexity is O(nlogn).
Which sorting algorithm makes minimum number of swaps?
Sorting means arranging a set of data in an order. There’re various algorithms to sort the data (in a data structure) in increasing or decreasing order. These algorithms can be divided on basis of various factors. Inplace sorting means that all the data which is to be sorted can be accommodated at a time in memory. Examples of inplace sorting algorithms are Selection sort, Bubble sort etc.
Quicksort worst-case and averages-case analysis
Quick Sort is capable of sorting a list of data elements significantly faster (twice or thrice faster) than any of the common sorting algorithms and that’s why it is the favourite topic of interviewers.