How does the number of comparisons needed by exchange sort compare with that required by bubble sort $1,$ which is the algorithm discussed in Section $6\mathrm{.}4\mathrm{.}1?$