5 #define USE_N_SQUARED_SORT
7 #define FAKE_MALLOC_INIT(words, name) \
8 uint32_t heap_##name[words]; \
9 const size_t max_alloc_##name = (words) * sizeof(uint32_t); \
10 size_t cur_pos_##name; \
11 void* fake_malloc_##name( size_t size ) \
13 static bool init = false; \
18 if(cur_pos_##name < (words)) { \
19 void *ptr = (void*) &heap_##name[cur_pos_##name]; \
20 cur_pos_##name += size & ~((uint32_t)3) + 1; \
34 n_squared_sort (float * value
, int * index
, int len
);
37 radix_sort_tuples (int * value
, int * index
, int len
, int radix_bits
);
40 insertion_sort (float * value
, int * index
, int len
);
43 quicksort (float * array
, int * index
, int len
);
45 /* This defines the length at quicksort switches to insertion sort */
51 #define RADIX_BITS (8)
55 #endif /* _TAV_SORT_H_ */