What does it mean for a sorting algorithm to be 'in place' ? O A single pass of the algorithm performs O(n) comparisons of adjacent elements and O(n) swaps of adjacent elements. O The algorithm has run time better than the theoretical limit for comparison based sorting algorithms. O The algorithm maintains the relative order of records with equal values. O The extra space required by the algorithm to store the data during the sort is independent of the size of the input.

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.