Learn C graph
Catalog preview0%
100%
Sorting and searching
Loop invariants, halving a range, and what an algorithm costs.
Required exercises0 / 7
7 required exercises0 optionalDifficulty 2 to 40 / 116 XP
Exercises · 7
ExerciseLevelXPStatus
is_sortedint is_sorted(const int *a, size_t n)+12Newsort_arrayvoid sort_array(int *tab, unsigned int size)+24Newbinary_searchlong binary_search(size_t n, int key, int (*at)(size_t))+16Newinsertion_stepsvoid insertion_steps(int *a, size_t n, void (*report)(const int *, size_t))+16Newpartitionsize_t partition(int *a, size_t lo, size_t hi)+16Newmerge_runsvoid merge_runs(const int *left, size_t ln, const int *right, size_t rn, int *out)+16Newsort_costunsigned long sort_cost(int *a, size_t n)+16New