Lower bounds on worst case of comparison sorting | Linear Time Sorting | Appliedcourse

Поділитися
Вставка
  • Опубліковано 31 січ 2025

КОМЕНТАРІ • 4

  • @amrfoundation5332
    @amrfoundation5332 6 місяців тому

    the best DSA series ever....the way sir explains with lots of different perspective is something which sets him apart from others

  • @rohitkumar-de9xw
    @rohitkumar-de9xw 5 років тому +2

    @28:22 sir, you said log(n!)=Theta of(nlogn) but actually log(n!)=O(nlogn) so after this point it becomes little difficult to understand inequality i.e. how h>=log(n!) becomes h>= nlogn. please explain.