1.6.2 - Week 2: Searching and Sorting
Enroll to start learning
You’ve not yet enrolled in this course. Please enroll for free to listen to audio lessons, classroom podcasts and take practice test.
Practice Questions
Test your understanding with targeted questions
What is linear search?
💡 Hint: Think of how you would search for a book on a shelf.
How does insertion sort work?
💡 Hint: Consider how you might sort a hand of playing cards.
4 more questions available
Interactive Quizzes
Quick quizzes to reinforce your learning
What is the time complexity of linear search?
💡 Hint: Think about how you would find an item in a list by checking each one.
True or False: Binary search can be used on unsorted arrays.
💡 Hint: Remember, binary search divides the array, so it needs order.
1 more question available
Challenge Problems
Push your limits with advanced challenges
Given a list of unsorted names, write a function to sort these names using quick sort and explain its efficiency compared to other sorting methods.
💡 Hint: Consider the choice of pivot and how that impacts the sorting speed.
Design an algorithm to find the second smallest number in an unsorted array after sorting it. Compare the performance with finding the same number using a linear search.
💡 Hint: Think about the steps involved in both approaches.
Get performance evaluation
Reference links
Supplementary resources to enhance your learning experience.