arechdico.py

Created by bilouclic

Created on December 15, 2024

520 Bytes

def chercher(tab, n, i, j):
    if i < 0 or j >= len(tab) 
    or i > j :
        return None
    else :
        m = (i + j) // 2
        if tab[m] < n: 
          return chercher
          (tab, n, m+1, j)
        elif tab[m] > n: 
          return chercher
          (tab, n, i, m-1)
        else: 
          return m

assert chercher([1,5,6,6,9,12]
,7,0,10) is None
assert chercher([1,5,6,6,9,12]
,7,0,5) is None
assert chercher([1,5,6,6,9,12]
,9,0,5) == 4
assert chercher([1,5,6,6,9,12]
,6,0,5) == 2

During your visit to our site, NumWorks needs to install "cookies" or use other technologies to collect data about you in order to:

With the exception of Cookies essential to the operation of the site, NumWorks leaves you the choice: you can accept Cookies for audience measurement by clicking on the "Accept and continue" button, or refuse these Cookies by clicking on the "Continue without accepting" button or by continuing your browsing. You can update your choice at any time by clicking on the link "Manage my cookies" at the bottom of the page. For more information, please consult our cookies policy.

Accept and continue Continue without accepting