Python Projects for Beginners a ten-Week Bootcamp Approach to Python Programming

Efficient Algorithms: Looking at the Binary Search we wrote, how could you possibly make it even more efficient?

Case-Sensitive Search: Rewrite the Binary Search so that it works with a list that holds both numbers and letters. It should be case sensitive. Use the following function call to understand the parameters being passed in. Hint: “22” < ‘a’ will return True.

>>> binarySearch( [ 'a', 22, '3', 'hello', 1022, 4, 'e' ] ,
'hello') # returns True
CHAPTER 9
Advanced Topics II: Complexity
This week is the continuation of advanced python concepts and will cover more topics that a developer has to understand on the job.
To begin the week, we’ll cover a concept that you’ve been using this whole time, generators and iterators. Over the following couple of days, we’ll cover decorators and modules, which will help us in building larger-scale applications. These concepts will help to understand how frameworks are used, like Flask and Django.
Although I don’t like talking about theory within this book, it’s important to understand how time complexity works with algorithms. On Thursday, we’ll dive into Big O Notation and understanding algorithms further. All the lessons within the book have led you to the point of being able to further your education into becoming a Python developer. This all leads us into our Friday project, which is interview prep. As this book is set up as a tool for improving or changing your career, an important piece of that is the interview process. There will be information about the process, what to expect, and how to handle some interview questions that you may be asked.
Overview

• 
  Understanding generator and iterator objects
  
• 
  Using and applying decorators
  
• 
  Creating and importing modules
  
• 
  What is time complexity and Big O Notation?
  
• 
  Knowing how to handle interviews, questions, and more
  

© Connor P. Milliken 2020
C. P. Milliken, Python Projects for Beginners, https://doi.org/10.1007/978-1-4842-5355-7_9