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...
Author
Venkatesan Prabu
Wikitechy Founder, Author, International Speaker, and Job Consultant. My role as the CEO of Wikitechy, I help businesses build their next generation digital platforms and help with their product innovation and growth strategy. I'm a frequent speaker at tech conferences and events.
2835 Articles
Find k closest elements to a given value
Find k closest elements to a given value - searching and sorting - start from the first element and search for the crossover...
QuickSort on Doubly Linked List
QuickSort on Doubly Linked List - Searching and sorting -. The idea is simple, we first find out pointer to last node. Once...
QuickSort on Singly Linked List
QuickSort on Singly Linked List - Searching and sorting - Quick Sort on Doubly Linked List is discussed here.In Singly...
Sort n numbers in range from 0 to n^2 – 1 in linear time
Sort n numbers in range from 0 to n^2 – 1 in linear time - Searching and sorting - If we use Counting Sort, it would take...
Iterative Quick Sort
Iterative Quick Sort - Searching and Sorting - Partition process is same in both recursive and iterative. The same...
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...
Merge Sort for Linked Lists
Merge Sort for Linked Lists - Searching and Sorting - Merge sort is often preferred for sorting a linked list. The slow...
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...
