Pagini recente » Monitorul de evaluare | Diferente pentru problema/s2c intre reviziile 32 si 31 | Istoria paginii runda/algo | Diferente pentru problema/s2c intre reviziile 31 si 30 | Diferente pentru trie-forest-based-sort intre reviziile 3 si 4
Nu exista diferente intre titluri.
Diferente intre continut:
Sorting Big Numbers using Trie-Forest based search
h3. Sorting Big Numbers using Trie-Forest based search
authors : Serban Lupulescu and Mircea Dima
h2. authors : Serban Lupulescu and Mircea Dima
The first idea is that if you have a string of length h, you can insert it in a trie of height h. We could maintain a list of tries,
h1. The first idea is that if you have a string of length h, you can insert it in a trie of height h. We could maintain a list of tries,
trie H[N], where H[i] is a trie with height i so when we insert a string with lenght i, we insert it in H[i].
Nu exista diferente intre securitate.
Topicul de forum nu a fost schimbat.
