Optimal Binary Search Tree
Optimal Binary Search Tree - Dynamic Programming Given a sorted array keys[0.. n-1] of search keys and an array freq[0.....
Browse Category
Binary Search Tree
9 Articles
Cpp Algorithm – Find minimum s-t cut in a flow network
Cpp Algorithm - Find minimum s-t cut in a flow network - Graph Algorithm - In a flow network, an s-t cut is a cut that...
A Problem in Many Binary Search Implementations
A Problem in Many Binary Search Implementations - Searching and Sorting - The above looks fine except one subtle thing, the...
Interpolation search vs Binary search
Interpolation search vs Binary search - Searching and Sorting - On average the interpolation search makes about log(log(n))...
Exponential Search
Exponential Search - searching and sorting algorithm - The name of this searching algorithm may be misleading as it works in...
TERNARY SEARCH
TERNARY SEARCH - searching and sorting algorithm - The ternary search does less number of comparisons as it makes Log3n...
Jump Search
Jump Search - search and sorting algorithm - Jump Search is a searching algorithm for sorted arrays.Basic idea is to check...
Linear Search
Linear Search - searching and sorting - algorithm -A simple approach is to do linear search, Start from the leftmost element...
C Programming – Check for Identical BSTs without building the trees
Check for Identical BSTs without building the trees - Given two arrays which represent a sequence of keys. Imagine we make a...
