Part I:

$($PLO S$2/$ CLO$2\mathrm{.}2/$ SO$6)$

Have a look at the following code snippet of a sorting algorithm. The algorithm exhibits a quadratic dependency in terms of the length of $x$ and can be parallelized easily.$($i$)$ Explain how this sorting algorithm works.$($ii$)$ Analyze the data dependencies of each loop. Which loop is ideally suited for a parallelization with OpenMP pragmas? Consider the problem of shared variables.$($iii$)$ Implement a parallel version of sequential$\_$sort according to your former considerations. Discuss speedup and efficiency. Please give me the answer