In this post, we will see how to sort an array of integers using iterative merge sort algorithm. Merge sort is an efficient sorting algorithm which falls under divide and conquer paradigm and produces a stable sort.
Given an unsorted array of integers, print all distinct four elements tuple (Quadruplets) in it having given sum.
Given an unsorted array of integers, check if it contains four elements tuple (Quadruplets) having given sum.
Given an array where all its elements are sorted except two elements which were swapped, sort the array in linear time. Assume there are no duplicates in the array.
Implement Quicksort algorithm using Hoare’s Partitioning scheme.
Given M sorted lists of variable length, print them in sorted order efficiently.
Given a collection of n items, each of which has a non-negative integer key whose maximum value is at most k, effectively sort it using counting sort algorithm.
Given an array with many duplicated elements, write an algorithm to efficiently sort it in linear time where the order of equal elements doesn’t matter.
Implement Quicksort efficiently for inputs containing many repeated elements.
Quicksort performance can be boosted in several ways. In this post, we will cover few of them.
Given a schedule containing arrival and departure time of trains in a station, find minimum number of platforms needed in the station so to avoid any delay in arrival of any train.
Given a set of intervals, print all non-overlapping intervals after merging overlapping intervals.