This topic covers the abstract data types and algorithms every programmer needs. Stacks, queues, linked lists and binary trees are each studied in turn, along with how to implement them using arrays and pointers, and the operations each one supports. Searching is covered through linear and binary search, and sorting through insertion sort and bubble sort. The topic also introduces Big O notation as a way of describing the time and space an algorithm requires.
🔒 Sign in to view this topic's basics.