19 followers
A.I.D.S | Competitive Programming | DSA | Machine Learning | Open Source | IT Awareness | Linux | Datasets | Scraping
The Infinite Multiplication: When Programs Multiply Themselves Without End · Fork bomb is a process which is enough to bring down your system by...
Session 09 - Binary Search & Recursion | Va Nanba DSA Padikalam Date and Time: Mar 14, 19:00 ISTMeeting Link: Jitsi Meet See you guys in Tuesday’s...
Part 1 Part 2 Topics Covered How to calculate Big O ? Four simple steps. O(n) Constant Time O(Log n) O (n log n)
Topics Covered Bounding Upper/Lower Bound Big O Omega Theta
Topics Covered Why Datastructure ? What is an Algorithm. Asymptotic Notation Upper Bound Tight upper bound Lower bound Tight Lower...
Topics Covered git init git clone git add git commit git branch git checkout git pull git push git config Git book on history side:...