it is the same amount of searches but it has to search through all 10,000 elements to find the next max value, where as an insertion only needs to shuffle it doesnt need to go through all 10,000 elements to find the max then go through all 9,999 to find the next max, etc etc