school
Acemy

Developing Algorithms Using Arrays

AP Computer Science A· difficulty 4/5

Selection sort works by

  • A

    Hashing values

  • B

    Dividing into halves

  • C

    Repeatedly finding the smallest unsorted element and placing it

    check_circle
  • D

    Bubbling adjacent comparisons

Explanation

Each pass: find min in remaining; swap to current position.

Want 10 more like this — adaptive to your weak spots?

Practice 10 like thisarrow_forwardPredict my AP score

Related questions

auto_awesomeAll Toolsquestion_answerHomework Q&Amenu_bookAP & SAT PreptimelineLearn Mode