3įinally, compare the fouth element(5) and the last element(2), and swap since 5 greater than 2. Then compare third and fourth elements (5 and 1). Since 5 is greater than 4 we do not swap and move on to the next element. Next comparison is between the second element (4) and the 3rd element (5). In this case, since 4 is greater than 3 you swap them. The first element in this array is 4 and second, 3.
For example, consider an array of five integer values as below 4 In this post, I will explain bubble sort and how to implement it in Java programming language.īubble sort iterates through elements of the arrays, comparing them and swapping if necessary. Conventionally it is taught in schools and colleges to introduce students to sorting algorithms but practically it is not suitable for large arrays because of its poor performance.
Bubble sort is a simple algorithm to sort elements of an array.
0 kommentar(er)
