lecture 8 lists and searching predicting l
play

Lecture 8: lists and searching Predicting l Let l = list(range(10)) . - PowerPoint PPT Presentation

Lecture 8: lists and searching Predicting l Let l = list(range(10)) . What does l equal after the following operations? l.append(11) del l[0] l.remove(1) Predicting l Let l = list(range(10)) . What does l equal after the following operations?


  1. Lecture 8: lists and searching

  2. Predicting l Let l = list(range(10)) . What does l equal after the following operations? l.append(11) del l[0] l.remove(1)

  3. Predicting l Let l = list(range(10)) . What does l equal after the following operations? l.append(11) [2, 3, 4, 5, 6, 7, 8, 9, 11] del l[0] l.remove(1) Let l = list(‘sub pop’) . What does l equal after the following operations?

  4. Predicting l Let l = list(range(10)) . What does l equal after the following operations? l.append(11) [2, 3, 4, 5, 6, 7, 8, 9, 11] del l[0] l.remove(1) Let l = list(‘sub pop’) . What does l equal after the following operations? l.insert(3,‘*’) l[len(l)-2] = ‘u’ l.append(‘!’) l.append(l.pop())

  5. Predicting l Let l = list(range(10)) . What does l equal after the following operations? l.append(11) [2, 3, 4, 5, 6, 7, 8, 9, 11] del l[0] l.remove(1) Let l = list(‘sub pop’) . What does l equal after the following operations? l.insert(3,‘*’) [‘s’, ‘u’, ‘b’, ‘*’, ‘ ’, l[len(l)-2] = ‘u’ ‘p’, ‘u’, ‘p’, ’!’] l.append(‘!’) l.append(l.pop())

  6. linear search l = ["The Strokes", "Bon Iver", "Arcade Fire", "The Black Keys", "Pixies", "The White Stripes", "Neutral Milk Hotel", "The National", "Yo La Tengo"] 1 def find startswith(lst,searchstr): 2 for s in lst: 3 if s.startswith(searchstr): 4 return s 5 return None

  7. binary search l = [’Arcade Fire’, ’Bon Iver’, ’Neutral Milk Hotel’, ’Pixies’, ’The Black Keys’, ’The National’, ’The Strokes’, ’The White Stripes’, ’Yo La Tengo’] 1 def find startswith(lst, searchstr): 2 low = 0 3 high = len (lst) − 1 4 while (low < = high): 5 mid = (high + low) // 2 6 if lst[mid].startswith(searchstr): 7 return lst[mid] 8 elif lst[mid] < searchstr: 9 low = mid+1 10 else : 11 high = mid − 1 12 return None

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend