notes-computer-algorithms-algorithmsNotes

if you are sorting IRL, as you are sorting you have a cache in your mind of elements you saw recently, where you put them (and probably what some other elements near them were). Eg if you are sorting numbers from least to greatest, you'll first go thru the list once and take some of its summary statistics (number of elements, average, min, max), and then you'll see a 400 and you'll be like "that's pretty low, i'll move it to the beginning", and then you'll see a 300 and be like, 'oh that's before the 400' and then you'll see a 500 and be like, 'oh i just saw a 400, let's put this right after that' (you know the number of elements and the min and max (and average) so you can estimate how far the 500 should be from the 400). Can algorithms make use of this too?