A&DS S01E03. Quick sort. Order statistics

Поделиться
HTML-код
  • Опубликовано: 26 янв 2025
  • Algorithms and data structures. Semester 1. Lecture 3.
    In the third lecture, we learned the quicksort algorithm, discussed how to estimate the running time of randomized algorithms, and also considered a related problem: finding the K-th order statistic.
    Home task and discussion: codeforces.com...
    ITMO University, 2020

Комментарии • 23