Kruskal’s Algorithm

Kruskal’s Algorithm Approach: greedy approach Purpose: to find a minimum spanning tree in a weighted graph Example   References Kruskal’s Algorithm | Essay Assignment | Seminar on Advanced Mathematics Spanning Tree | tutorialspoint Kruskal’s Spanning Tree Algorithm | tutorialspoint Prim’s Spanning Tree Algorithm | tutorialspoint


In practice, quicksort outperforms merge sort, and it significantly outperforms selection sort and insertion sort. The average-case running time of quicksort is as good as mergesort’s. That’s because the constant factor hidden in the big-Θ notation for quicksort makes mergesort quite faster than mergesort. Not using additional storage. pivot, split point Example References Overview of quicksort | […]

Studying ‘Differential Equations’

References Second order linear equations | Differential Equations | Khan Academy I learned this topic very easily through this material. I learned how to solve the second order linear homogeneous equations 3 types of the character equation and its general solutions how to solve the second order linear nonhomogeneous equations The method of undetermined coefficients Summary […]