Floor and Ceil from a BST-There are numerous applications we need to find floor (ceil) value of a key in a binary search tree or sorted array.
JAVA Programming-Merge Sort for Doubly Linked List – Searching and Sorting – Merge sort for singly linked list is already discussed. The important change here is to modify the previous pointers also when merging two lists.
JAVA Program Count 1’s in a sorted binary array – Searching and Sorting – A simple solution is to linearly traverse the array. The time complexity of the simple solution is O(n). We can use Binary Search to find count in O(Logn) time.
JAVA programming – Given a sorted array and a number x, find the pair in array whose sum is closest to x – Searching and sorting – Given a sorted array and a number x, find a pair in array whose sum is closest to x.
Java Programming – Longest Common Subsequence – Dynamic Programming – LCS problem has optimal substructure property as main problem can be solved .
JAVA Programming-Find common elements in three sorted arrays – Searching and sorting – A simple solution is to first find intersection of two arrays and store the intersection in a temporary array, then find the intersection of third array and temporary array.
Java Programming – Longest Increasing Subsequence – Dynamic Programming – The LIS problem is to find the length of the longest subsequence of a given sequence.
JAVA programming K’th Smallest/Largest Element in Unsorted Array | Set 2 (Expected Linear Time) – Searching and Sorting – Given an array and a number k where k is smaller than size of array, we need to find the k’th smallest element in the given array. It is given that ll array elements are distinct.
How do I call one constructor from another in Java? In Java another constructor of the same class can be called from a constructor via this().
Why is it faster to process a sorted array than an unsorted array -When the data is sorted, roughly the first half of the