00:01
In this question asking that the constant c is greater than equals to 0, then we have to show that there is no comparison based sorting algorithm that can be short using less than cn.
00:11
So as algorithm, the solution for this one is for a, for the first one here, n factorial, different possible combinations are different, different possible combinations.
00:26
Permutations are there, permutations are for the set for input, a1, a2 up to an here.
00:39
There are total and factorial different possible combinations.
00:42
So for example, here a1, a4 and a2 here is answer for the input.
00:53
Answer for input.
00:58
If input is over here, a1, 4.
01:00
4 as here a 1 a 4 4 1 and 3 here and n factor input for each n factor are put permutations here so let here the input are n factorial splitting s into let us take this one is our set s here for with n factorial permutations so let s has size n factorial so algorithm can be so algorithm must be taken must be taken must must be taken as log of 2 base 2 n factorial comparisons...