because each swap depends on the previous one. Odd-Even method solves this. for(int i = 0; i < n; i++): Outer loop runs n times to guarantee full sorting. #pragma omp parallel for for(j = 0; j < n-1; ...

1. To understand Bubble Sort and Merge Sort algorithms. 2. To implement parallel versions using OpenMP directives. 3. To measure and compare performance using omp_get_wtime(). 4. To understand ...