Counting Sort
Counting sort - Searching and Sorting - Counting Sort is a sorting technique based on keys between a specific range. It...
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
Radix Sort
Radix Sort - Searching and Sorting -The lower bound for Comparison based sorting algorithm (Merge Sort, Heap Sort,...
QuickSort
QuickSort - Searching and Sorting - Like Merge Sort, QuickSort is a Divide and Conquer algorithm. It picks an element as...
Heap Sort
Heap Sort - Searching and Sorting - Heap sort is a comparison based sorting technique based on Binary Heap data structure....
Minimum Number of Platforms Required for a Railway/Bus Station
Minimum No of Platforms Required for a Railway/Bus Station - Greedy algorithm - Given arrival and departure times of all...
K Centers Problem
K Centers Problem - Greedy Algorithm - Given n cities and distances between every pair of cities, select k cities to place...
Greedy Algorithm to find Minimum number of Coins
Greedy Algorithm to find Minimum number of Coins - Greedy Algorithm - Given a value V, if we want to make change for V Rs....
C Algorithm – Introduction for Linked List | Set 1
C Algorithm - Introduction for Linked List | Set 1 - Linked List - Like arrays, Linked List is a linear data structure....
Job Sequencing Problem
Job Sequencing Problem - Greedy Algorithm - Given array of jobs where every job has deadline and associated profit if job is...
Dijkstra’s Algorithm for Adjacency List Representation
Dijkstra’s Algorithm for Adjacency List Representation - Greedy Algorithm - We have discussed Dijkstra’s algorithm and its...
