Pagini recente » Istoria paginii utilizator/andreibaraian | Atasamentele paginii Profil bujorcatalin14 | Istoria paginii utilizator/kriptex | Istoria paginii runda/mindcoding_e_naspa/clasament | Diferente pentru blog/heaps-shortlist intre reviziile 2 si 1
Nu exista diferente intre titluri.
Diferente intre continut:
4. Given an array of n numbers, describe an efficient algorithm that prints out the smallest k numbers in the array.
5. A Young Tableau is a matrix where elements on each row or column appear in increasing order. Given a Young Tableau A, describe an efficient algorithm that returns the kth element of A.
6. Given a min heap A, give an efficient algorithm that outputs its kth smallest element.
7. Print out the first k numbers of the type 2^i^ * 3^j^.
7. Print out the first k numbers of the type 2^i * 3^j.
Nu exista diferente intre securitate.
Topicul de forum nu a fost schimbat.
