Question

Name 3 sorting algorithms, give a short description and discuss which one you prefer and why.

Answer 1

Answer:

Three sorting algorithm are:

1. Merge sort : It is based upon divide and conquer algorithm. It divides the array into parts and sort it and at last merges the array.
2. Selection sort : In this sorting, it finds the minimum element and replace with the first element.
3. Bubble sort : In this sorting occurs by checking adjacent element and swap it in the order.

I prefer selection sort because it finds the minimum element and swap it at the same time in a sorted manner.