Introduction to Search Techniques in Python: Binary Search

oferecido por
Coursera Project Network
Neste projeto guiado, você irá:

Learn about lists, if conditions and for loops.

Define functions and apply the concept of recursion.

Construct functioning binary search code.

Clock2 hours
CloudSem necessidade de download
VideoVídeo em tela dividida
Comment DotsInglês
LaptopApenas em desktop

By the end of this project, you will be able to code the binary search technique using Python programming language. Throughout the tasks, you will be able to identify and apply the basic skills needed for every programming language such as lists, functions, recursion and if conditions. Each part of this project will prepare you to code on your own in Python language, whether to work on search techniques or simple coding Python programming is one of the easiest programming languages, since its syntax is English-like. It is used in many applications and mastering it will definitely pave a way for you to start a career in any programming-based field. Python is also the base for the machine learning and deep learning field. Note: This course works best for learners who are based in the North America region. We’re currently working on providing the same experience in other regions.

Habilidades que você desenvolverá

  • Python Programming
  • Binary Search Algorithm
  • Python Basics

Aprender passo a passo

Em um vídeo reproduzido em uma tela dividida com a área de trabalho, seu instrutor o orientará sobre esses passos:

  1. By the end of Task 1, you will be able to open and easily work with Sublime Text Editor,identify the concept of Binary search technique,and differentiate between and use lists and arrays.

  2. By the end of Task 2, you will be able to write if conditions and trace them manually.

  3. By the end of Task 3, you will be able to write for loops and trace the results.

  4. By the end of Task 4, you will be able to define new functions and call them in your code.

  5. By the end of Task 5, you will be able to apply the concept of recursion to functions.

  6. By the end of Task 6, you will be able to take an input from the user and sort an unsorted list.

  7. By the end of Task 7, you will be able to set the project’s logic and construct a fully functioning binary search code.

Como funcionam os projetos guiados

Sua área de trabalho é um espaço em nuvem, acessado diretamente do navegador, sem necessidade de nenhum download

Em um vídeo de tela dividida, seu instrutor te orientará passo a passo

Perguntas Frequentes – FAQ

Perguntas Frequentes – FAQ

Mais dúvidas? Visite o Central de Ajuda ao estudante.