Prim’s Minimum Spanning Tree – Greedy Algorithm – We have discussed Kruskal’s algorithm for Minimum Spanning Tree. Like Kruskal’s algorithm, Prim’s algorithm is also a Greedy algorithm. It starts with an empty spanning tree the idea is to maintain two sets of vertices.
Algorithm
Bubble Sort – searching and sorting algorithm – Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements .
Selection Sort – searching and sorting algorithm – The selection sort algorithm sorts an array by repeatedly finding the minimum element .
Exponential Search – searching and sorting algorithm – The name of this searching algorithm may be misleading as it works in O(Log n) time.
Interpolation Search – searching and sorting algorithm- The Interpolation Search is an improvement over Binary Search for instances, where the values .
TERNARY SEARCH – searching and sorting algorithm – The ternary search does less number of comparisons as it makes Log3n recursive calls, but binary search.
Jump Search – search and sorting algorithm – Jump Search is a searching algorithm for sorted arrays.Basic idea is to check fewer elements.
Performance of loops – Analysis of Algorithm – Consider below two C language functions to compute sum of elements in a 2D array.
Strassen’s Matrix Multiplication-Divide and Conquer-Given two square matrices A and B of size n x n each, find their multiplication .
Closest Pair of Points – Divide and Conquer – We are given an array of n points in the plane, and the problem is to find out the closes together.