> [TOC] # Algorithms & Data Structures ## Week 1 : Standard notations, common functions & Sorting ### Asymptotic analysis * Asymptotic tight bound(Big-theta) * Asymptotic upper bound(Big-oh) * Asymptotica lower bound(Big-omega) * Upper bound that is not asymptotically tight(small oh) * Lower bound that is not asymptotically tight(small omega) ### Probability & Statistics * Mean * Variance, Std Deviation * Permutations & Combinations * Counting techniques * Conditional probability ### Sorting Classification * Adaptive * Stable * In-place * online/offline * Serial/Parallel * Recursive * Comparative ### Insertion sort #### Codes * Psudo code * Java code * UML #### Applications #### Related Algorithms * Selection sort * Shell sort * Bubble sort > [time=Tue, Aug 13, 2019 1:00 AM] > [name=Bala Gangadhar]
×
Sign in
Email
Password
Forgot password
or
By clicking below, you agree to our
terms of service
.
Sign in via Facebook
Sign in via Twitter
Sign in via GitHub
Sign in via Dropbox
Sign in with Wallet
Wallet (
)
Connect another wallet
New to HackMD?
Sign up