I am not obsessive!

Computer Science Level 2

Let's say you have spent an unhealthy portion of your life collecting and linearly sorting an incredulous amount of plastic birds (\(\geq 10^6\)) by color in your room. All of your birds are unique (you have of-course verified this by precisely computing each bird's \(\color{green}{\text{R}} \color{red}{\text{G}} \color{blue}{\text{B}}\) value.)

You have all birds in order. One day, your nefarious little brother, sneaks into your room, taking one bird and putting it in a wrong position. Which of the following sorting schemes is your best bet at efficiently sorting your precious plastic bird collection?

View solutions
View wiki
Thaddeus Abiy by Thaddeus Abiy
×

Problem Loading...

Note Loading...

Set Loading...