Monday, May 18, 2020

Data Structures and Algorithms

Big O notation:
- Worst case execution complexity
O(1) : access the data at first lookup
O(n) : lookup a data in a list of n items (linear complexity).
O(n^2): nested loops(2loops)
O(n!) : loop for each item in the list of data

- Space complexity

Good code:
- Readable
- Scalable (speed and Memory)

For Quick Overview : https://drive.google.com/drive/folders/1t75vJEgzndUVp_Jndh9O7tPN9xTu5s57?usp=sharing

For Distributed design : http://book.mixu.net/distsys/intro.html


No comments:

Post a Comment

Enter your Comments & suggestion here.. no need for signing up..