Merge Sort Merge Sort is a Divide and Conquer algorithm. It divides input array in two halves, calls itself for the two halves and then merges the two sorted halves. algorithms DSA

Divide and Conquer Divide and conquer is an algorithm design paradigm based on multi-branched recursion algorithms DSA

Pseudocode A notation resembling a simplified programming language, used in program design algorithms DSA

Insertion Sort The simplest sorting algorithm that works the way one would sort playing cards in hand. algorithms DSA

Algorithms and Data Structures Algorithms are generally created independent of underlying languages, i.e. an algorithm can be implemented in more than one programming language algorithms DSA

Zero Sum Subarrays To find continous sub-arrays that have sum zero. array-algorithms references algorithms

Sort Binary Array To sort a binary array using Quicksort logic. array-algorithms references algorithms

Pair Sums In An Array To find a pair in an array that add up to a given number. array-algorithms references algorithms

Duplicate In Limited Range Array (XOR) One way to find the duplicate in a limited range array using XOR operation. array-algorithms references algorithms