- Forum
- General C++ Programming
- Sort an array of integers of size n in a
Sort an array of integers of size n in ascending order of values
I have no idea how to approach this problem, someone please give me a hint or head start.
Write a program to sort an array of integers of size n in ascending/increasing order of values. Test the program on the following set of input values: 4, 67, -2, 0, 489, 23, -17, 32, 5, and 120.
USE ONLY "While" and "Do While" statements for loop construction
Write a program to sort an array of integers of size n in ascending/increasing order of values. Test the program on the following set of input values: 4, 67, -2, 0, 489, 23, -17, 32, 5, and 120.
USE ONLY "While" and "Do While" statements for loop construction
closed account (zwA4jE8b)
look up bubble sort. most of the example you find will use a for loop but you can convert it to a while loop. I say bubble sort because it is the easiest.
Last edited on
Topic archived. No new replies allowed.