Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- def sort(tab,p):
- if p==0:
- for i in range(0,size):
- for j in range(0,size-1):
- if tab[j]>tab[j+1]:
- temp=tab[j+1]
- tab[j+1]=tab[j]
- tab[j]=temp
- return tab
- if p==1:
- for i in range(0,size):
- for j in range(0,size-1):
- if tab[j]<tab[j+1]:
- temp=tab[j+1]
- tab[j+1]=tab[j]
- tab[j]=temp
- return tab
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement