We say that an array A is c$-$nice for a constant c if for all $1<=$ i j $<=$ n such that j $$ i $>=$ c$,$ wehave that A$[$i$]<=$ A$[$j$].$ For example, a $1-$nice array is completely sorted $($in ascending order$).$ Inthis problem we will sort such c$-$nice arrays A using InsertionSort and QuickSort and comparethe results.