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

Continue reading# Category: Sorting

## Heap Sort

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

Continue reading## 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

Continue reading## 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:

Continue reading## Radix Sort : Explained

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

Continue reading## 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

Continue reading## Insertion Sort in C

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

Continue reading## Bubble Sort in C

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

Continue reading## Operations on Arrays

What is an array? An array is a data structure that stores homogeneous/same data type values in it, and the

Continue reading## Merge Sort Algorithm

Problem: Given an array of size n, sort the array using Merge Sort. Examples: Example 1: Input: N=5, arr[]={4,2,1,6,7} Output:

Continue reading