fork download
  1. import random # matrixsortp.py
  2. n=3; m=5; a=[1,1]; b=[1,1]
  3. a=[[random.randrange(0,9) for i in range (m)] for j in range (n)]
  4. b=[[1 for i in range (m)] for j in range (n)]
  5.  
  6. for i in range (n):
  7. for j in range (m):
  8. print ("%2d" % a[i][j], end=' ')
  9. b[i][j]=a[i][j]
  10. print()
  11. print()
  12.  
  13. for i in range (n):
  14. for j in range (m-1):
  15. for k in range (j+1,m):
  16. if (a[i][j]>a[i][k]):
  17. t=a[i][j]; a[i][j]=a[i][k]; a[i][k]=t;
  18.  
  19. for i in range (n):
  20. for j in range (m):
  21. print ("%2d" % a[i][j], end=' ')
  22. print()
  23. print()
  24.  
  25. for i in range (n):
  26. for j in range (m):
  27. print ("%2d" % b[i][j], end=' ')
  28. print()
  29. print()
  30.  
  31. for j in range (m):
  32. for i in range (n-1):
  33. for k in range (i+1,n):
  34. if (b[i][j]>b[k][j]):
  35. t=b[i][j]; b[i][j]=b[k][j]; b[k][j]=t;
  36.  
  37. for i in range (n):
  38. for j in range (m):
  39. print ("%2d" % b[i][j], end=' ')
  40. print()
  41.  
Success #stdin #stdout 0.08s 14348KB
stdin
Standard input is empty
stdout
 3  7  7  1  2 
 0  4  7  1  5 
 8  0  0  6  5 

 1  2  3  7  7 
 0  1  4  5  7 
 0  0  5  6  8 

 3  7  7  1  2 
 0  4  7  1  5 
 8  0  0  6  5 

 0  0  0  1  2 
 3  4  7  1  5 
 8  7  7  6  5