Matrix-Zigzag (or diagonal) traversal of Matrix
Matrix-Zigzag (or diagonal) traversal of Matrix - Matrix - Given a 2D matrix, print all elements of the given matrix in...
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
Dijkstra’s shortest path algorithm
Dijkstra’s shortest path algorithm - Greedy algorithm - Dijkstra’s algorithm is very similar to Prim’s algorithm for minimum...
Prim’s MST for Adjacency List Representation
Prim’s MST for Adjacency List Representation - Greedy algorithm - We have discussed Prim’s algorithm and implementation for...
Merge Sort
Merge Sort - searching and sorting algorithm - Like QuickSort, Merge Sort is a Divide and Conquer algorithm. It divides...
Prim’s Minimum Spanning Tree
Prim’s Minimum Spanning Tree - Greedy Algorithm - We have discussed Kruskal’s algorithm for Minimum Spanning Tree. Like...
Insertion Sort
Insertion Sort - searching and sorting algorithm - Insertion sort is a simple sorting algorithm that works the way we sort...
Efficient Huffman Coding for Sorted Input
Efficient Huffman Coding for Sorted Input - Greedy Algorithm - Time complexity of the algorithm discussed in above post is...
Bubble Sort
Bubble Sort - searching and sorting algorithm - Bubble Sort is the simplest sorting algorithm that works by repeatedly...
Selection Sort
Selection Sort - searching and sorting algorithm - The selection sort algorithm sorts an array by repeatedly finding the...
Exponential Search
Exponential Search - searching and sorting algorithm - The name of this searching algorithm may be misleading as it works in...
