## Sort an array using Young tableau

In this post, we will see how to sort N2 numbers in increasing order using a N x N Young tableau in O(N3) time.

Coding made easy

In this post, we will see how to sort N2 numbers in increasing order using a N x N Young tableau in O(N3) time.

Given an array of integers between 0 to 9, find two numbers with maximum sum formed by using all digits of the array. The difference in number of digits of the two numbers should be ± 1.

Given an array of integers, find a triplet having maximum product in the array.

The Arrays class is a member of the Java Collections Framework and contains various static utility methods for array manipulation. In this post, we will discuss the difference between sort() and parallelSort() method of the Arrays class in Java.

In this post, we will see how to sort an array of integers using iterative merge sort algorithm.

Given an array of integers, find all distinct combinations of given length.

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.

In this post, we will discuss how to sort a vector of pairs in C++.

Implement Quick sort algorithm using Hoare’s Partitioning scheme.

In this post, we will discuss how to sort a vector of integers in C++ in ascending order.