Skip to content

sorting using random library #2

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
KomalpKaur wants to merge 1 commit into
base: master
Choose a base branch
from
Open

sorting using random library #2

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
33 changes: 33 additions & 0 deletions SortingUsingRandom.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,33 @@
'''
1. take input from user:
n=no of elements
lista=list of elements(unsorted)

2. take random index i,j using random.randin and replace elements on that i,j index
3. repaet step 2 until list is sorted
'''
import random
n = int(input("enter no of elements"))
lista = []
listb = []
print("enter unsorted elements")
for k in range(n):
temp = int(input())
lista.append(temp)
listb = lista
def checksort(listb):
i = random.randint(0, len(listb)-1)
j = random.randint(0, len(listb)-1)
temp2 = listb[i]
listb[i] = listb[j]
listb[j] = temp2
return listb

while (not listb == sorted(lista)):
if (not listb == sorted(lista)):
checksort(listb)
elif(listb == sorted(lista)):
break

for k in range(n):
print(listb[k],' ',end='')