Python: Work with one other class member (if you can--if you can't coordinate, you can have a group of 1) DO Create several python lists of a variety of lengths, but they should be >10 elements and...

Python:

Work with one other class member (if you can--if you can't coordinate, you can have a group of 1)

DO

Create several python lists of a variety of lengths, but they should be >10 elements and probably less than 100

Here's some code to create a list of random numbers and random size:

import random
mylist=random.sample(range(100),random.randrange(10, 101, 1)) # unique values
# mylist=random.choices(range(100),k=random.randrange(10, 101, 1)) # contains duplicates

• Use python's search method to find out if certain numbers are in the list and to count them.


• Write a bubble sort to sort the list in place


• Write a binary search function to find items in the sorted lists
  
  
  
  
  • binary search will start in the middle of the list, then determine if it should look in the left half or right half of the remaining list... then continue until it finds a result or it isn't there.
  
  
  
  


• Write a search to count the items in the list (not using the list.search method) in your sorted lists


• You may need longer lists to test out timing to see if your search and sort are faster than pythons.


• Can you think of a way to use the binary search to count duplicate elements?

For testing you may want to generate lists with a smaller range of numbers (100 elements between 1 and 10).