Backtracking Set 4 (Subset Sum) – Backtracking – Subset sum problem is to find subset of elements that are selected from a given set whose sum adds up.
backtrack
6 Articles
6
C Programming-Backtracking Set 3 (N Queen Problem) – Backtracking – We have discussed Knightâs tour and Rat in a Maze problems in Set 1 and Set 2 respectively. Let us discuss N Queen as another example problem that can be solved using Backtracking.
JAVA Programming-Backtracking Set 3 (N Queen Problem) – JAVA – discuss N Queen as another example problem that can be solved using Backtracking.
Binary Insertion Sort – Searching and Sorting – We can use binary search to reduce the number of comparisons in normal insertion sort. Binary Insertion Sort find use binary search to find the proper location to insert the selected item at each iteration.
Interpolation Search – searching and sorting algorithm- The Interpolation Search is an improvement over Binary Search for instances, where the values .
Jump Search – search and sorting algorithm – Jump Search is a searching algorithm for sorted arrays.Basic idea is to check fewer elements.