The best way to sort a 1000 byte array (least complexity)
Anonymous
Each entry is one byte which is 8 bits. Thus it goes from 0-255, so there are repeated values, one can iterate once, pick the values and clump them together. So complexity is 0(n).
Check out your Company Bowl for anonymous work chats.