[25-26] Algorithmique avancée 2 [S3] [SPE]

Looking for [25-26] Algorithmique avancée 2 [S3] [SPE] test answers and solutions? Browse our comprehensive collection of verified answers for [25-26] Algorithmique avancée 2 [S3] [SPE] at moodle.esme.fr.

Get instant access to accurate answers and detailed explanations for your course questions. Our community-driven platform helps students succeed!

View this question

Consider the following merge sort algorithm:

def merge_sort(array):
    if len(array) <= 1:
        return array
    middle = len(array) // 2
    left = merge_sort(array[:middle])
    right = merge_sort(array[middle:])
    return merge(left, right)

What is its time complexity in the worst case?

View this question

Want instant access to all verified answers on moodle.esme.fr?

Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!

Add to Chrome