ExplanationIn the above program eight numbers are entered. The while loops and for loop are
used to access the elements, compare and exchange the elements. Every element of an array is
compared with all successive elements. When a small element is found it is stored at the beginning
location in the array using tmp variable.
Time complexity: Time complexity of bubble sort is 0(n2). This is because in each pass the elements
that
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month, and much more.