69 CS651 Lecture Notes - Lecture 9: Asymptotic Analysis, Linked List
Document Summary
L9: asymptotic notations in java (in english) | Lesson 9 | dsa in java | @codingninjasindia. This video is a part of a new playlist of videos on data structures and algorithm in java by coding ninja In this video we will learn about the following topics. At the very first we will see why performance analysis is important. we will also learn about asymptotic analysis and commonly used notation We can decide which data structures is best for algorithm. The main question arises in our mind is that what basis on what we see we should compare the time. the running time to perform any operation depends on the size of the input The beginning of the linked list is faster than adding. the data in arrays, we can compare the data structure and select the best possible data structure for performing the operations.