Bubble Sort

View as PDF

Submit solution

All submissions

Best submissions

Points: 7

Time limit: 1.0s

Memory limit: 64M

Authors:

LOLWHATOMGBBQ, FatalEagle

Problem type

FatalEagle is playing with $N$ $N$ blocks, each with a distinct number $T$ $T$ $(0 \le T \le 256)$ $(0 \leq T \leq 256)$ on it. He is trying to learn how to sort the blocks in ascending order with bubble sort. He would like you to show him the steps to sort his blocks. Click here for a description of bubble sort.

Input Specification

The first line will have the integer $N$ $N$ $(0 \le N \le 20)$ $(0 \leq N \leq 20)$ .

The next line will have $N$ $N$ integers, each separated with a space.

Output Specification

Print the initial block sequence, then after each time bubble sort swaps two elements, print the current block sequence.

Sample Input 1

Copy

2
2 1

Sample Output 1

Copy

2 1
1 2

Sample Input 2

Copy

6
9 1 2 6 4 7

Sample Output 2

Copy

9 1 2 6 4 7
1 9 2 6 4 7
1 2 9 6 4 7
1 2 6 9 4 7
1 2 6 4 9 7
1 2 6 4 7 9
1 2 4 6 7 9

Comments

-23

anasschoukri commented on March 7, 2017, 11:54 a.m.

I guess there is a problem in submission cause in ever time I submitted my code , the platform show me in each submissions a warning in a result.

This comment is hidden due to too much negative feedback. Show it anyway.

17

Kirito commented on March 7, 2017, 3:16 p.m.

Clearly these 99 users are all hackers then

-16

anasschoukri commented on March 7, 2017, 6:31 p.m.

https://dmoj.ca/problem/sort1/submissions/anasschoukri/ look at this man it s the same code but with different result

This comment is hidden due to too much negative feedback. Show it anyway.

15

Xyene commented on March 7, 2017, 7:15 p.m.

Yes, because your code is incorrect and invokes undefined behaviour due to out-of-bounds array indexing. That's why you're getting a different number of WAs each run, because your code's behaviour is undefined.

7

EG117 commented on Dec. 14, 2015, 3:11 p.m.

If I am not mistaken this is neither Bubble nor selection, but some sort of hybrid. I am probably wrong but can someone explain?

-11
omaewamoushindeiru commented on Nov. 28, 2014, 11:09 p.m.
Copy
9 1 2 6 4 7 1 9 2 6 4 7 1 2 9 6 4 7 1 2 6 9 4 7 1 2 6 4 9 7 1 2 4 6 9 7 1 2 4 6 7 9
This comment is hidden due to too much negative feedback. Show it anyway.

5

FatalEagle commented on Nov. 28, 2014, 11:18 p.m.

The bubble sort algorithm scans that array many times, each time swapping any adjacent elements that are out of order back into order. Once it swaps, it keeps searching through the rest of the array instead of going back to the beginning. Thus, the problem statement has the correct output.