:: DATA STRUCTURE ::

solve these problems according to data structure course.

its preferred to use JAVA language in coding if needed!!!

use simple and short methods and give the answers its better to be by KEYBOARD not hand-written answers.

make the answers clear in both questions.

2. Determine the worst-case complexity of the following program void transpose (int al llMAX SIZE] int ii, temp; for i 0; i MAX SIZE-1, i++) for J i 1; j MAX SIZE; j++) SWAP (a[i][jkalj][il,temp); 3. Please write down the code to do selection sort a) Analysis the worst-case complexity of the selection sort b) Write down the code to do the performance measurement of the selection sort