JAVA programming – Given a sorted array and a number x, find the pair in array whose sum is closest to x
JAVA programming - Given a sorted array and a number x, find the pair in array whose sum is closest to x - Searching and...
Browse Tag
selection sort in data structure
9 Articles
C++ programming – Given a sorted array and a number x, find the pair in array whose sum is closest to x
C++ programming - Given a sorted array and a number x, find the pair in array whose sum is closest to x - Searching and...
C programming – Given a sorted array and a number x, find the pair in array whose sum is closest to x
C programming - Given a sorted array and a number x, find the pair in array whose sum is closest to x - Searching and...
Search in an almost sorted array
Search in an almost sorted array - Searching and Sorting - A simple solution is linearly search given key in given...
Sort a nearly sorted (or K sorted) array
Sort a nearly sorted (K sorted) array - Searching and sorting - Given an array of n elements, where each element is at most...
Find the Minimum length Unsorted Subarray, sorting which makes the complete array sorted
Find the Minimum length Unsorted Subarray, sorting which makes the complete array sorted -Searching and sorting - Given an...
Lower bound for comparison based sorting algorithms
Lower bound for comparison based sorting algorithms - Searching and sorting - A sorting algorithm is comparison based if it...
Insertion Sort
Insertion Sort - searching and sorting algorithm - Insertion sort is a simple sorting algorithm that works the way we sort...
Selection Sort
Selection Sort - searching and sorting algorithm - The selection sort algorithm sorts an array by repeatedly finding the...
