Are you looking for the solution of Harvard’s CS50 PSet 3? Do you want the CS50 Sort Solution of week 3?
If so you’re in the right place.
In this article, I’m going to share with you exactly how to solve the CS50 Sort problem and will also share the CS50 Sort solution with you.
Here’s how to solve the CS50 Sort problem.
The first thing to do is to understand what we are trying to build. You can read the instructions from CS50’s website.
In this problem, we are supposed to analyze three (compiled!) sorting programs to determine which algorithms they use.
In a file called answers.txt in a folder called sort, we have to record our answers, along with an explanation for each program, by filling in the blanks marked TODO.
Here’s my answer for the CS50 Sort Solution:
sort1 uses: Bubble sort
How do you know?: unsorted real: 0.157s and sorted real: 0.064s
sort2 uses: Merge sort
How do you know?: unsorted real: 0.079s and sorted real: 0.091s
sort3 uses: Selection sort
How do you know?: unsorted real: 0.171s and sorted real: 0.169s
If you have any confusion or problem, feel free to drop a comment down below. In the meantime, you can read these articles.
