What are the instuctions of asymptotic running time analysis?
Add a comment
1. An algorithm that runs in O(n) time is better than that which runs in O(n2) time. 2. O(log n) is better than O(n). 3. hierarchy of functions : log n http://in.docsity.com/en-video/Data_Structures_and_Algorithms-Naveen_Garg-Lecture_1
pecking order associated with operates : firewood in < d < n2 < n3 < twoenqa_d
This video lecture will help Data Structures and Algorithms