Question

True or False?

1. Radix sort is a general-purpose sorting algorithm.

2. Insertion sort is not efficient for large arrays.

3. You cannot partition a chain of linked nodes.

4. The n-queens problem requires an n x n chessboard and uses the rules of chess to create a solution.

Answer 1

Solution:-

1) Correct option - True

It is a general-purpose sorting algorithm and comparatively 3 times faster than other algorithms in this category.

2) Correct option - True

In case of large arrays generally sorting techniques used are quick , heap. Insertion sort is not much efficient in these cases.

3) Correct option - False

By chain of linked nodes it can be understood as a linked list and partition of linked list is possible.

4) Correct option - True

In n - queen problem a n x n chessboard is needed and placement of queen is done so that no two of them attack each other.