New Post Sign in

Home Explore Saved Profile

Home Explore Saved Profile

Community guidelines

About AI on OfCourse: AI answers are summaries of student posts and can be wrong or out of date. Check the linked posts and your official course materials, and follow your course's academic integrity rules.

Guidelines Terms© 2026 OfCourse

Ana Souza · OfCourse

AS

Ana Souza

Georgia Tech Verified(verified university email)

@anasouza

Computer Science · Georgia Tech · Class of 2028

Joined October 2025

3Contributions

9Lumens

2Comments

1Courses

Featured contributions

DiscussionQuick sort vs merge sort: which did you find harder to implement?Glowing · 4 litCS 1332

Posts1

4. Glowing · 4 lit, 0 off.

DiscussionCS 1332

Quick sort vs merge sort: which did you find harder to implement?

ASAna Souza9 Lumens·Georgia Tech

Recent comments

on Quick sort vs merge sort: which did you find harder to implement?· CS 1332 · 3 weeks agoDuplicates were my nightmare too!
on Heaps: my notes on up-heap, down-heap and building a heap· CS 1332 · 2 months ago0-based vs 1-based messed me up for an entire evening, lol.

Courses

CS 1332
Data Structures & Algorithms
Spring 2025 · 3 contributions

(verified university email)

·Summer 2026

·

3 weeks ago

Merge sort was conceptually easy for me, but I kept messing up the merge step with indices. Quick sort's partitioning felt more fiddly at first but clicked after a while. Curious which one gave everyone else more trouble, and what helped.

Recursion Sorting