Selection Sort Algorithm | Iterative & Recursive

Given an array of integers, sort it using selection sort algorithm.     Selection sort is a unstable, in-place sorting algorithm known for its simplicity, and it has performance advantages over more complicated algorithms in certain situations, particularly where auxiliary memory is limited. It can be implemented as a stable sort.

Activity Selection Problem

In Activity Selection Problem, we’re given a set of activities and the starting & finishing time of each activity, we need to find the maximum number of activities that can be performed by a single person assuming that a person can only work on a single activity at a time.  

Sort List in Reverse Order in Java

In this post, we will discuss several ways to sort list in reverse order in Java. The given list is modifiable, but not necessarily resizable.

Sort Map by keys in Java

In this post, we will discuss various methods to sort Map in Java according to the natural ordering of its keys.

Sort List in Ascending Order in Java

In this post, we will discuss several ways to sort List in ascending order in Java. Assume the specified list is modifiable, but not necessarily resizable.