If n = 2i
then proof that Tn = 2n-1 for merge sorting recurrence. Steps taken to complete the sorting is n - 1
The general form is
Tk = 2k Tn/2k + kn - 2k + 1
Please see the image I've attached for more context
My attempt
If n = 2i
then proof that Tn = 2n-1 for merge sorting recurrence. Steps taken to complete the sorting is n - 1
The general form is
Tk = 2k Tn/2k + kn - 2k + 1
Please see the image I've attached for more context
My attempt
Copyright © 2021 JogjaFile Inc.