Searching and Sorting
1. Which of the following is the most basic searching algorithm?
2. Which sorting algorithm repeatedly swaps adjacent elements if they are in the wrong order?
3. What is the time complexity of binary search in a sorted array?
4. Which of the following is NOT a comparison-based sorting algorithm?
5. Which searching algorithm is best suited for finding an element in a sorted array?
6. Which sorting algorithm has the best average-case time complexity?
7. Which of the following statements about searching and sorting is TRUE?