@aishab
Computer Science · Georgia Tech · Class of 2026
Joined September 2025
12 hrs/week10/10 difficultyWould take again
Workload: about 12 to 15 hours a week, more during the tree unit. What went well: the course builds steadily. Once linked lists and recursion made sense, trees felt like a natural next step, and graphs built on both. What was hard: the coding assignments have…
I kept mixing sorts up, so I made a memory hook for each. Bubble sort: big values "bubble" to the end each pass. Stable, in place, O(n²). Insertion sort: sorting a hand of cards. Great on nearly sorted input. Selection sort: repeatedly select the smallest rema…