fork download
  1. def insertionSort(inventory):
  2. indexingRange = range(2, len(inventory) + 1) # 2 .. len(inventory) + 1
  3.  
  4. for i in indexingRange:
  5. x = inventory[i][1]
  6.  
  7. while i > 1 and inventory[i-1][1] > x: # check i value first and compare with 1
  8. inventory[i-1], inventory[i] = inventory[i], inventory[i-1]
  9. i = i - 1
  10. return inventory
  11.  
  12. print(insertionSort(
  13. {1: ['', 1],
  14. 2: ['', 2],
  15. 3: ['', 3],
  16. 4: ['', 4],
  17. 5: ['', 8],
  18. 6: ['', 20],
  19. 7: ['', 2]}
  20. )
  21. )
Success #stdin #stdout 0.02s 9172KB
stdin
Standard input is empty
stdout
{1: ['', 1], 2: ['', 2], 3: ['', 2], 4: ['', 3], 5: ['', 4], 6: ['', 8], 7: ['', 20]}