tms8c8:
I have a pretty huge array that I'd like to squeeze on an Arduino. It is 4 rows by 720 columns. The difficulty lies primarily in the fact that the first row needs to store long variables but the other three rows only need to store byte variables.Edit: Unless someone has a clever way of fitting this array onto a Nano or other ATMega328 based board, this will be handled by a ATmega2560 with 8 KB of SRAM
1 x 720 x 4 bytes = 2880
3 x 720 x 1 byte = 2160
Total 5040 bytes
If all longs:
4 x 720 x 4 bytes = 11520 bytes
You aren't going to fit all longs anyway.
As for your original question, some sort of modified quicksort? Modified in the sense that, when you sort the first row, and have to swap, you also swap the other 3 rows to match.