Searching and Sorting

Front

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."

Back

Selection Sort

Front

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."

Back

Insertion Sort

Front

Which algorithm matches this description: "a sorting algorithm designed specifically for integers. The algorithm makes use of a concept called buckets and is a type of bucket sort. Any array of integer values can be subdivided into buckets by using the integer values' digits. A bucket is a collection of integer values that all share a particular digit value."

Back

Radix Sort

Front

Assume Radix sort and integers X and Y, such that X < Y. X will always be in a lower bucket than Y.

Back

False

Front

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

Back

searching

Front

A searching technique which is based on Divide and Conquer approach

Back

Binary search

Front

A searching technique which works on both sorted and unsorted list

Back

Linear Search

Front

A sorting technique where consecutive elements are compared and swapped

Back

bubble sort

Front

A sorting technique which is based on the base of the number

Back

radix sort

Front

What is an external sorting algorithm?

Back

Algorithm that uses tape or disk during the sort