Search and Sort (Insertion/Bubble Sort/Selection Sort)

Which algorithm matches this description: "a sorting algorithm that treats the input as two parts, a sorted part and an unsorted part, and repeatedly selects the proper next value to move from the unsorted part to the end of the sorted part."

• Selection Sort

• Insertion Sort

• Radix Sort

• Merge Sort

Which algorithm matches this description: "a sorting algorithm that treats the input as two parts, a sorted part and an unsorted part, and repeatedly inserts the next value from the unsorted part into the correct location in the sorted part."

• Selection Sort

• Insertion Sort

• Merge Sort

• Radix Sort

The mechanism of finding an element /key in a given set of elements is known as ________________

• sorting

• searching

• both

• none

A searching technique which works on both sorted and unsorted list

• Binary search

• Linear Search

• both

• none

A sorting technique where consecutive elements are compared and swapped

• slection

• insertion

• bubble sort

• shell sort

What is the advantage of bubble sort over other sorting techniques?

• A. It is faster

• B. Consumes less memory

• C. Detects whether the input is already sorted

• D. All of the mentioned

The following lists represent 3 passes of a sorting algorithm. Which algorithm is being used to sort the list?
 
4    8    6    2    5    7 
4    8    6    2    5    7 
4    6    8    2    5    7

• Bubble Sort
• Selection Sort
• Insertion Sort

Which sorting algorithm places each number into the right place one after the other until all are in the right place.

• Insertion
• Bubble