A. True or False
1. In linear search, the elements are examined sequentially starting from the fi rst element.
2. In binary search, the elements in a list must be in a sorted order.
3. Any sort algorithm that uses the main memory exclusively during sorting is called an internal sort algorithm.
4. Binary search algorithm compares an element to be searched with the last element of a list in eachiteration.
5. Internal sorting is slower than external sorting.
6. Insertion sort is based on the principle of inserting the elements at their correct place in a previously
sorted list.
7. Insertion sort always maintains a sorted sublist in the lower portion of a list.
8. Quick sort divides a list into two smaller sublists.
9. In selection sort, the smallest element from an array is obtained and placed at the last position of th array.
10. Internal memory is used for external sort algorithm.