Guest User

Untitled

a guest
Nov 22nd, 2017
75
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.04 KB | None | 0 0
  1. def swap(list_vals, min_val_index, i):
  2. temp = list_vals[min_val_index];
  3. list_vals[min_val_index] = list_vals[i];
  4. list_vals[i] = temp;
  5.  
  6. def selection_sort(list_vals):
  7. num_of_elements = len(list_vals);
  8.  
  9. # reduces the each inner iteration loop size by one.
  10. for i in range(0, num_of_elements-1):
  11. # position of minimum element in the list
  12. # Assuming first element to be the minimum
  13. min_val_index = i;
  14. # finds minimum value position in the list of elements.
  15. for j in range(i+1, num_of_elements):
  16. if (list_vals[j] < list_vals[min_val_index]):
  17. min_val_index = j;
  18.  
  19. swap(list_vals, min_val_index, i);
  20.  
  21. return list_vals;
  22.  
  23. if __name__ == "__main__":
  24. list_vals = [30, 10, 20, 70, 60, 80, 50, 40];
  25. print("Angka yg blum di sort: %s" % str(list_vals));
  26. print("Angka yg disort: %s" % str(selection_sort(list_vals)));
Add Comment
Please, Sign In to add comment