## Part 2 ITE6201 Data Structures and Algorithm Analysis

The rearranging of pairs of elements which are out of order, until no such pairs remain.

___________ sorting algorithm is frequently used when n is small, where n is the total number of elements.

#### Feedback

The method used by card sorter.

Which of the following is not the required condition for binary search algorithm?

Partition and exchange sort is ____________.

Which of the following sorting algorithm is of priority queue sorting type?

_____________ order is the best possible for array sorting algorithm which sorts n item.

State True or False for internal sorting algorithms.

i. Internal sorting are applied when the entire collection if data to be sorted is small enough that the sorting can take place within main memory.

ii. The time required to read or write is considered significant in evaluating the performance of internal sorting.

Which of the following is not a limitation of binary search algorithm?

Binary search algorithm cannot be applied to _______________.

If the number of records to be sorted is small, then __________ sorting can be efficient.

Sorting algorithm can be characterized as ________________.

The complexity of sorting algorithm measures the __________ as a function of the number n of items to be shorter.

The complexity of bubble sort algorithm.

The complexity of merge sort algorithm.

The average case occurs in linear search algorithm _______________.

The worst case occurs in linear search algorithm when ________________.

The complexity of linear search algorithm.