I need to write a c program that sort coins from smallest to largest value. The only move that we can make are those that interchange the locations of two neighboring values.
For example: if we have this: (1c) (10c) (1c)(10c)(1c)(10c)
the sorted versoon for N=3 should be,
Please state the efficiency if the program usung the Big-O notation. please answer with the most efficient program possible thank you.

"Get 15% discount on your first 3 orders with us"
Use the following coupon

Order Now