{"id":38008,"date":"2016-10-14T17:21:02","date_gmt":"2016-10-14T22:21:02","guid":{"rendered":"http:\/\/danigguemez.wordpress.com\/?p=432"},"modified":"2016-10-14T17:21:02","modified_gmt":"2016-10-14T22:21:02","slug":"bubble-sort","status":"publish","type":"post","link":"https:\/\/kenscourses.com\/tc101fall2016\/syndicated\/bubble-sort\/","title":{"rendered":"Bubble sort"},"content":{"rendered":"

--Originally published at Fundamentos de Programaci\u00f3n<\/a><\/a><\/em>
<\/p>\n

Just like the previous challenge, this time we had to put a list in order but instead of using random we use the bubble sort method (thanks God!).<\/p>\n

\"rw9ykew_700wa_0\"<\/p>\n

It is so much better and efficient, in contrast with random, also it is less code so if you want to do it the better way….. don’t use any of this, there is a built in function in python that does it for you hehe<\/p>\n

\"krqrjmd_700wa_0\"<\/p>\n

Don’t go! it’s still usefull to know this way of sorting. Here it is:<\/p>\n

\"bubble1\"<\/p>\n

The same as the random code except that instead of sorting asigning random index we use the function bubble(). This function, while the list is not sorted, compares each pair of numbers that are side by side in the list and if the first one is greater than the second one it swiches the position of those numbers.<\/p>\n

\"xw7v9db_700w_0\"<\/p>\n

The rest is just printing the list an the amount of times the while repeated. Hava a look to the results to compare the difference between this and random sorting:<\/p>\n

\"bubble2\"<\/p>\n

And with 10 numbers:<\/p>\n

\"bubble3\"<\/p>\n

Big difference.<\/p>\n

Here is a video to help you out:<\/p>\n