2: Write the C++ code of a function that takes an array and its size, and then sort the array data in ascending using Odd-Even sorting algorithm. Odd-Even sorting algorithm compares even odd index elements alternatingly in each iteration. In first iteration odd-even index (considering index starts at 1) pairs of elements are compared, and swapped, if required, then in next iteration even-odd pair of elements are compared. This process continues until the data is sorted completely. An example is give

Write the C++ code for the following question you cannot use goto statement break or continue statement in it

Unsorted 2 Phase (odd) 2 3 8 Phase 2 (even) 2 L LPhase 3 (odd) 2 3 3 5 4 Phase 4 (even) LPhase 5 (odd) 2 3 8 Phase 6 (even) 2 1 Phase 7 (odd) 3 8 Phase 8 (even) 2 4 8 Sorted