CSE 2050 Conceptual Test with Correct Verified Answers| Latest 2024
Insertion Sort (O(n) - ANSWER Binary Search - Each item is taken in turn, compared to the items in a sorted list, and placed in the correct position. Merge Sort (O(n log n)) - ANSWER Divide-and-conquer paradigm - A list is split into individual lists, these are then combined (2 lists at a time). Quicksort (O(n log n)) - ANSWER Divide-and-conquer paradigm - a sorting technique that moves elements around a pivot and recursively sorts the elements to the left and the right of the pivot
Written for
- Institution
- CSE 2050
- Course
- CSE 2050
Document information
- Uploaded on
- July 1, 2024
- Number of pages
- 3
- Written in
- 2023/2024
- Type
- Exam (elaborations)
- Contains
- Questions & answers
Subjects
Also available in package deal