There are certain logos like Apple’s or Nike’s that are highly successful and lasting that they come to your mind just by merely mentioning the brand name. So ...
royal52
In programming languages, Function overloading is a process of declaring multiple member functions having same name but differ in one of the following ...
In C++ programming language, Functions overriding is a process of declaring the functions of same name and signatures as in a parent classes and a child ...
In programming, the multilevel inheritance is a technique or process in which a child class is inherited from another derived class. Let’s think of it in terms ...
It is a process or mechanism in which a child class is inherited from two parent classes. Some programming languages allows multiple inheritance like C++ and ...
Inheritance in C++ is a programming technique for producing a new class which has a properties and functionality of a class from which it is inherited. The ...
Insertion sort C++ is one of the most commonly used algorithm in C++ language for the sorting of fewer values or smaller arrays. It is preferred our Selection ...
Merge sort C++ is one of the very efficient algorithm in programming languages. It is normally used for the sorting of large data. Normally, Quicksort is ...
QuickSort C++ is one of the fastest sorting algorithm in programming. Quick Sorting works on divide and conquer approach. It sorts the array in such a way so ...
In a nutshell, hellgeeks.com provides Answers to all Programming Problems, Analysis of technological trends, and Solutions to Everything Software which can ...
In the following article we will discuss the sorting of arrays and elaborate the operations of selection sort with complete examples. Sorting of Arrays:- ...
What are Loops in C++:- Loop is the process of repetition of the certain steps until the given condition becomes false. They are always remains continue until ...
just write if(array[j] lesser then array[j+1]) instead of if(array[j] greater then array[j+1]) and it will sort the array in descending order.
I have updated my comment with a code block containing while loop, cheers.
Okay, that’s the code of Bubble sort by using While Loop written in C++.
while(i < 4) { int j = 0; while(j < 4) { if(array[j]>array[j+1])
{
hold=array[j];
array[j]=array[j+1];
array[j+1]=hold;
}
j++;
}
i++;
}
If you have any other questions then let me know, thanks.
yes we can use a while loop.
Welcome
thanks for pointing out.
my pleasure :)
thanks for pointing out !!!