+1 (218) 451-4151
glass
pen
clip
papers
heaphones

1. Describe an in-place version of the selection-sort algorithm for an array that uses only O(1)…

1. Describe an in-place version of the selection-sort algorithm for an array that uses only O(1)…

1. Describe an in-place version of the selection-sort algorithm for an array that uses only O(1) space for instance variables in addition to the array.2. Assuming the input to the sorting problem is given in an array A, describe how to implement the insertion-sort algorithm using only the array A and at most six additional (base-type) variables.