Explain bubble sorting.
- 1 Answers
- 1170 Views
- I also Faced
- E-Mail Answers
Answer / Anjali Chaudhary
"Bubble sort is a simple sorting algorithm that repeatedly compares adjacent elements and swaps them if they are in the wrong order. The process continues until the entire list is sorted or no more swaps are needed. It has a worst-case and average time complexity of O(n^2) but requires constant space"
| Is This Answer Correct ? | 0 Yes | 0 No |
Compare compile time polymorphism and Runtime polymorphism
Explain how would you handle a situation where you cannot call the destructor of a local explicitly?
What is bubble sort c++?
Snake Game: This is normal snake game which you can find in most of the mobiles. You can develop it in Java, C/C++, C# or what ever language you know.
Explain the difference between 'operator new' and the 'new' operator?
How a modifier is similar to mutator?
Is c# written in c++?
What is virtual base class?
What are structs in c++?
Of the numbers 12 23 9 28 which would be at the top of a properly implemented maxheap a) 28 b) 9 c) Any of them could be
Can we specify variable field width in a scanf() format string? If possible how?
What is difference between malloc()/free() and new/delete?
STL 
