rearrange nodes so that nodes[i] <= nodes[k] for all i < k nodes[k] <= nodes[j] for all j > k low and high are the bounds of the index range during the rearranging process
source not stored for this graph (policy: none)
no test coverage detected