![1. Complete the following O(n2) sorting algorithm by replacing??? by the proper code fragment. void swap(int[] a, int i, int j) int tali a [j] - ti void sort (intll a) int k = 1; /1 Invariant: first k elements of the array a are ordered while (ka.length) k++i](https://d2vlcm61l7u1fs.cloudfront.net/media%2Fd9b%2Fd9b5bd6d-f38a-46dc-b60b-54cff825fd7e%2FphpqmeTAs.png)
Write the program in C#
1. Complete the following O(n2) sorting algorithm by replacing”???” by the proper code fragment. void swap(int[] a, int i, int j) int tali a [j] – ti void sort (intll a) int k = 1; /1 Invariant: first k elements of the array a
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured