## Recursive Bubble Sort Algorithm

Problem Statement: Given an array of N integers, write a program to implement the Recursive Bubble Sort algorithm. Examples: Example

## Recursive Insertion Sort Algorithm

Problem Statement: Given an array of N integers, write a program to implement the Recursive Insertion Sort algorithm. Examples: Example

## Contains Duplicate : Check if a value appears atleast twice

Problem Statement: Given an integer array nums, return true if any value appears at least twice in the array, and return

## Heap Sort

Heap sort is a sorting algorithm that sorts data in ascending or descending order using the input data. It is

## Bucket Sort : Detailed Explanation

Introduction You would wonder, why we need bucket sort even though we have sorting algorithms that work in O(nlogn). Bucket

## Kth largest/smallest element in an array

Problem Statement: Given an unsorted array, print Kth Largest and Smallest Element from an unsorted array. Examples: Example 1: Input:

Introduction Radix sort is a non-comparison-based stable algorithm that uses counting sort with a little modification to sort the numbers

## Selection Sort in C

Problem Statement: Given an array of N integers, write a program to implement the Selection sorting algorithm. Examples: Example 1: Input: N