Fast methods for performing this function operate in O(n log n) (read: big "oh" of n log n) time, and include the "merge" and "binary tree" methods. The most common method to do this steps through an array, interchanging adjacent elements repeatedly until no changes are made on one full trip, called the "bubble" method. For 10 points, name this common operation, the act of interchanging members of a list until they are in
Fast methods for performing this function operate in O(n log n) (read: big "oh" of n log n) time, and include the "merge" and "binary tree" methods. The most common method to do this steps through an array, interchanging adjacent elements repeatedly until no changes are made on one full trip, called the "bubble" method. For 10 points, name this common operation, the act of interchanging members of a list until they are in a pre-defined order.
Fast methods for performing this function operate in O(n log n) (read: big "oh" of n log n) time, and include the "merge" and "binary tree" methods.
{sorting}