An in$-$place sorting algorithm is an algorithm which transforms input using no auxiliary data structure. However, a small amount of extra storage space is allowed for auxiliary variables $($some temp variables but not another array$).$ The input is usually overwritten by the output as the algorithm executes. An in$-$place algorithm updates its input sequence only through replacement or swapping of elements. Choose every algorithm whose in$-$place version is available.