Python programming language The base case for Merge sort is

(Python programming language) The base case for Merge sort is a list of size?

a)0

b)1

c)Both 0 and 1

d)None of the above

Solution

c) Both 0 and 1

Merge sort is a recursive algorithm that repeatedly splits a list in half. If the list is empty or has one item, which is base condition , it is sorted . If the list has more than one item, split the list and recursively call merge sort on both halves. Once the two halves are sorted, merge is performed.