Week 3

Question 1

Sorting Algorithm (Mergesort)

Answer 1

1.Divide the list recursively into two equal halves until we have one element in each group
2.Merge the smaller sorted lists into larger sorted lists and repeat until one sorted list

Question 2

Sorting Algorithm
(Quicksort)

Answer 2

Initially one of the data items is selected as a pivot. All data items less than the pivot are placed on the left-hand side of the array and all other data items are placed on the right-hand side of the array. The pivot is then placed between the two groups

Question 3

Choosing the pivot

Answer 3

*Always select the first element as the pivot
*Always select the last element as the pivot
*Select any random element as the pivot
*Select the median element as the pivot

Question 4

Backtracking Algorithm

Answer 4

The algorithms attempts to complete a search for a solution to a problem by constructing partial solutions, always ensuring that the partial solutions remain consistent with the requirements of the problem. The algorithm then attempts to extend a partial solution towards completion, but when an inconsistency with the requirements of the problem occurs, the algorithm backtracks by removing the most recently constructed part of the solution and trying another possibility