7
codeBoy
7y

# Lets play a little python game together and win some devRant points : We have an array of integers named L We need to sort this array so that the biggest number be in the beginning and lowest at the end..descending order Rules: -You are not allowed to write more than one line of code in the comment...only one -if you comment once...you cannot comment directly after that...you have to wait for two other comments after you so you can comment again -you have to build your code upon the previous comments ... you cannot start from scratch -the lucky one who puts the final comment is the winner..and we should all ++ his comment to give him the biggest amount of points Lets start and see who will win :)

• 23
L.sort(reverse=True)
• 2
@Arjun he probably should have made it C or something
• 1
@Arjun my God! That easy... i didn't know about the sort function ðŸ˜‚ðŸ˜‚ðŸ˜‚ so to make it playable lets not use the sort function
• 2
@RazorSh4rk or JavaðŸ˜‚ðŸ˜‚
• 3
@codeBoy I thought I was the winner for a moment ðŸ˜‚ðŸ˜‚
• 1
@Arjun u deserve to be
• 1
Nah, it was too easy. Without using built -in sort is challenging
• 1
@Arjun so lets start over
• 1
I'm sorry ðŸ˜‚ðŸ˜‚ the game shall continue
• 1
# The following code is a sort algorithm made together by the devRant community:
• 3
for x in L:
• 2
If L [x] < L [x+1]:
• 2
tmp = L[x]
• 3
L [x] = L [x+1]
• 2
L [x+1] = tmp