Diferente pentru trie-forest-based-sort intre reviziile #12 si #13

Nu exista diferente intre titluri.

Diferente intre continut:

#define maxh 666013
#define N 10024
// Sorting Big Numbers using Trie-Forest based sort indexed in a STL set (Red-Black Tree)
// copyright   idea :          Serban Lupulescu
//             implementation: Mircea Dima
// Time Complexity: O(n*max_len)
// Faculty of Mathematics and Computer Science, University of Bucharest
// :D
 
using namespace std;
inline int length(char a[])

Nu exista diferente intre securitate.

Topicul de forum nu a fost schimbat.