Find the closest pair from two sorted arrays – Searching and Sorting – Given two sorted arrays and a number x, find the pair whose sum is closest to x and the pair has an element from each array.
sorting algorithms pdf
3 Articles
3
Lower bound for comparison based sorting algorithms – Searching and sorting – A sorting algorithm is comparison based if it uses comparison operators to find the order between two numbers.
Comb Sort – Searching and Sorting – Comb Sort is mainly an improvement over Bubble Sort. Bubble sort always compares adjacent values. So all inversions are removed one by one. Comb Sort improves on Bubble Sort by using gap of size more than 1.