Simple Algorithms from different complexity classes.
This is the source code for the Udemy course which offers a gentle introduction to asymptotic notation, complexity theory and algorithm runtime or space complexity classification.
The Udemy course for this repo can be found at:
https://www.udemy.com/course/big-o-notation-for-algorithms-in-plain-english/?referralCode=9161687A1A6BDD088464
This source code has examples from different complexity functional classes, from constant O(1) to exponential O(c^n). For the quadratic code we use a graphics package written by John Zelle. It's source code is bundled with this project so you don't need to download anything.
Please do get in touch if you have any suggestions/improvements!
Follow me on https://twitter.com/cutajarj
And checkout my blog at: www.cutajarjames.com
Here's a cactus in ASCII, because why not:
,`""',
;' ` ;
;`,',;
;' ` ;
,,, ;`,',;
;,` ; ;' ` ; ,',
;`,'; ;`,',; ;,' ;
;',`; ;` ' ; ;`'`';
;` '',''` `,',`',;
`''`'; ', ;`'`'
;' `';
;` ' ;
;' `';
;` ' ;
; ',';
;,' ';
dwb\|/\|/;\|/