Chapter 3

Question 1

Arranging the data in ascending or descending order is known as

Answer 1

sorting

Question 2

If all the data that is to be sorted can be adjusted at a time in the main memory

Answer 2

Internal Sorting

Question 3

When the data that is to be sorted cannot be accommodated in the memory at the same time and some has to be kept in auxiliary memory such as hard disk, floppy disk, magnetic tapes etc

Answer 3

External Sorting

Question 4

consecutive adjacent pairs of elements in the array are compared with each other

Answer 4

bubble sorting

Question 5

This procedure of sorting is called __ because elements ‘bubble’ to the top of the list.

Answer 5

bubble sorting

Question 6

is a very simple sorting algorithm in which the sorted array (or list) is built one element at a time.

Answer 6

Insertion sort

Question 7

inserts each item into its proper place in the final list.

Answer 7

Insertion sort

Question 8

is conceptually the simplest sorting algorithm

Answer 8

Selection sorting

Question 9

means combining two sorted lists into one-sorted list.

Answer 9

Merging

Question 10

splits the array to be sorted into two equal halves and each array is recursively sorted, then merged back together to form the final sorted array.

Answer 10

merge sort

Question 11

sorts by employing a divide and conquer strategy to divide a list into two sublists.

Answer 11

Quick sort

Question 12

is very similar to that of the Insertion sort algorithm.

Answer 12

Shell sort algorithm