http://git.tuvimen.i2p/aoc2024/tree/01/sol2.c
= EOF ) { * ( uint * ) farray_inc ( arr [ 0 ]) = x ; * ( uint * ) farray_inc ( arr [ 1 ]) = y ; } farray_conv ( arr [ 0 ],( void * ) arr1 , arr1l ); farray_conv ( arr [ 1 ],( void * ) arr2 , arr2l ); } void my_qsort ( uint * arr , const size_t begin , const size_t end ) { if ( begin >= end ) return ; const uint pivot = arr [ end ]; size_t i = begin ; uint t ; for ( size_t j = begin ; j < end ; j ++ ) { if ( arr [ j ] < pivot ) { t = arr [...