Is for C not C++

1.- This sorting algorihtm works by repeatedly swapping the adjacent elements if they are in wrong order. Example: First Pass: (51428)-> (15 4 2 8), Here, algorithm compares the first two elements, and swaps since 5> 1 (15428)-> (14 5 2 8), Swap since 5> 4 (14528)-> (14 2 5 8), Swap since 5> 2 (14 258)-> (14 2 5 8), Now, since these elements are already in order (8> 5), algorithm does not swap them Second Pass: (14258)->(14258) 14258)-> (1245 8), Swap since 4> 2 (12458)->(12 458) (12458)-> (12 458) Now, the array is already sorted, but our algorithm does not know if it is completed. The algorithm needs one whole pass without any swap to know it is sorted Third Pass: (12458)-> (12 458) (12458)-> (12 458) (1245 8)->(12 458) (1245 8)->(12 458) Develop the pseudocode and program that implements this algorithm