摘要：public class Graph{ public void dfs(Vertex u) { u.visit(); u.visited = true; for(each v such that (u,v) belongs E) { if(!v.visited)... 阅读全文

摘要：Bucket Sort:Scenario:Work when keys are in a small range.Linked List.Algorithm(Stable):1. Walk through each item and enqueue each item into its approp... 阅读全文

摘要：Quick sort is empirically fastest among all the O(nlogn) sorting algorithms.Time Complexity:Best, Average, T(n) = 2T(n/2) + O(n) => O(nlogn)Worst case... 阅读全文