In this unit you will: know Big O notation, searching, stacks, and queues; compare sorting methods, running times, and stability; apply search trees, heaps, and hash tables; match graph algorithms and algorithm design paradigms; apply everything at exam level. Practice with instant feedback, free and no sign-up needed.
Explanation and example questions