1.5M
VI๐๐จ๐ฐ ๐ข๐ญ ๐ฐ๐จ๐ซ๐ค๐ฌ:
Go through the array, one value at a time.
For each value, compare the value with the next value.
If the value is higher than the next one, swap the values so that the highest value comes last.
๐๐จ๐๐:
for (int i = 0; i < n - 1; i++) {
for (int j = 0; j < n - i - 1; j++) {
if (myArray[j] > myArray[j + 1]) {
// Swap myArray[j] and myArray[j + 1]
int temp = myArray[j];
myArray[j] = myArray[j + 1];
myArray[j + 1] = temp;
}
}
}
follow @visualcoders for more visuals
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
#coding #programming #code #programmers #dsa #algorithm #datastructure #cse #coders #computerscience #csit #softwareengineering #softwareengineer #softwaredeveloper #softwaredeveloper #java #backend #backenddeveloper #visualization #visualcoders #btech #bca #engineers
@visualcoders
