Python PCEP Sorting Simple Lists
0 likes69 views
This document discusses sorting lists in Python. It provides an example of bubble sort to sort a sample list from [8, 10, 6, 2, 4] to increasing order. It then shows how to sort a list using a for loop to iterate through the list and swap adjacent elements if out of order. Finally, it notes that Python has a built-in .sort() method to easily sort lists from highest to lowest without needing to implement a bubble sort algorithm.
1 of 5
![Module 2 Sorting simple lists
Sorting a list
my_list = [8, 10, 6, 2, 4] # list to sort
swapped = True # It's a little fake, we need it to enter the while loop.
while swapped:
swapped = False # no swaps so far
for i in range(len(my_list) - 1):
if my_list[i] > my_list[i + 1]:
swapped = True # a swap occurred!
my_list[i], my_list[i + 1] = my_list[i + 1], my_list[i]
print(my_list)](https://image.slidesharecdn.com/12ihtm-pcep-m2-sorting-lists-210517134511/85/Python-PCEP-Sorting-Simple-Lists-3-320.jpg)
![Module 2 Sorting simple lists
Ready-to-use tools
Python has its own
sorting mechanisms: .sort()
my_list = [8, 10, 6, 2, 4] # list to sort
swapped = True # It's a little fake, we need it to enter the while loop.
my_list.sort()
print(my_list)](https://image.slidesharecdn.com/12ihtm-pcep-m2-sorting-lists-210517134511/85/Python-PCEP-Sorting-Simple-Lists-4-320.jpg)
Ad
Recommended
More Related Content
What's hot (18)
Similar to Python PCEP Sorting Simple Lists (20)
Ad
More from IHTMINSTITUTE (16)
Ad
Recently uploaded (20)
Python PCEP Sorting Simple Lists
- 1. Module 2 Data Collections – Lists, Tuples, and Dictionaries Sorting simple lists
- 2. Module 2 Sorting simple lists Bubble sort 8 10 6 2 4 8 6 10 2 4 8 6 2 10 4 8 6 2 4 10 6 8 2 4 10 6 2 8 4 10 6 2 4 8 10 2 6 4 8 10 2 4 6 8 10 Increasing order
- 3. Module 2 Sorting simple lists Sorting a list my_list = [8, 10, 6, 2, 4] # list to sort swapped = True # It's a little fake, we need it to enter the while loop. while swapped: swapped = False # no swaps so far for i in range(len(my_list) - 1): if my_list[i] > my_list[i + 1]: swapped = True # a swap occurred! my_list[i], my_list[i + 1] = my_list[i + 1], my_list[i] print(my_list)
- 4. Module 2 Sorting simple lists Ready-to-use tools Python has its own sorting mechanisms: .sort() my_list = [8, 10, 6, 2, 4] # list to sort swapped = True # It's a little fake, we need it to enter the while loop. my_list.sort() print(my_list)
- 5. Module 2 Sorting simple lists Key takeaways sort() •to sort elements of a list reverse() •to reverse the list