{"id":219647,"date":"2023-11-06T16:30:00","date_gmt":"2023-11-06T16:30:00","guid":{"rendered":"https:\/\/datascientest.com\/?p=219647"},"modified":"2024-02-21T10:10:16","modified_gmt":"2024-02-21T10:10:16","slug":"binary-search-tout-savoir","status":"publish","type":"post","link":"https:\/\/datascientest.com\/binary-search-tout-savoir","title":{"rendered":"Binary search ou recherche dichotomique : Qu&rsquo;est-ce que c&rsquo;est ?"},"content":{"rendered":"\t\t<div data-elementor-type=\"wp-post\" data-elementor-id=\"219647\" class=\"elementor elementor-219647\" data-elementor-post-type=\"post\">\n\t\t\t\t\t\t\t<div class=\"elementor-element elementor-element-01a630b e-flex e-con-boxed e-con\" data-id=\"01a630b\" data-element_type=\"container\" data-settings=\"{&quot;content_width&quot;:&quot;boxed&quot;}\">\n\t\t\t\t\t<div class=\"e-con-inner\">\n\t\t\t\t<div class=\"elementor-element elementor-element-20c168d elementor-widget elementor-widget-heading\" data-id=\"20c168d\" data-element_type=\"widget\" data-widget_type=\"heading.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<style>\/*! elementor - v3.15.0 - 02-08-2023 *\/\n.elementor-heading-title{padding:0;margin:0;line-height:1}.elementor-widget-heading .elementor-heading-title[class*=elementor-size-]>a{color:inherit;font-size:inherit;line-height:inherit}.elementor-widget-heading .elementor-heading-title.elementor-size-small{font-size:15px}.elementor-widget-heading .elementor-heading-title.elementor-size-medium{font-size:19px}.elementor-widget-heading .elementor-heading-title.elementor-size-large{font-size:29px}.elementor-widget-heading .elementor-heading-title.elementor-size-xl{font-size:39px}.elementor-widget-heading .elementor-heading-title.elementor-size-xxl{font-size:59px}<\/style><h2 class=\"elementor-heading-title elementor-size-default\">Connue \u00e9galement sous le nom de recherche par moiti\u00e9, la recherche dichotomique est un algorithme puissant dans le domaine de l\u2019informatique et l\u2019algorithmique qui permet de trouver rapidement une valeur dans un ensemble de donn\u00e9es tri\u00e9es. Accrochez-vous pour d\u00e9couvrir en profondeur son fonctionnement, ses avantages et ses inconv\u00e9nients ainsi que ses applications.<\/h2>\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t<div class=\"elementor-element elementor-element-3e2c26b e-flex e-con-boxed e-con\" data-id=\"3e2c26b\" data-element_type=\"container\" data-settings=\"{&quot;content_width&quot;:&quot;boxed&quot;}\">\n\t\t\t\t\t<div class=\"e-con-inner\">\n\t\t\t\t<div class=\"elementor-element elementor-element-07a1923 elementor-widget elementor-widget-heading\" data-id=\"07a1923\" data-element_type=\"widget\" data-widget_type=\"heading.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<h3 class=\"elementor-heading-title elementor-size-default\">Les origines de la recherche dichtomique<\/h3>\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-53fe56f elementor-widget elementor-widget-text-editor\" data-id=\"53fe56f\" data-element_type=\"widget\" data-widget_type=\"text-editor.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<style>\/*! elementor - v3.15.0 - 02-08-2023 *\/\n.elementor-widget-text-editor.elementor-drop-cap-view-stacked .elementor-drop-cap{background-color:#69727d;color:#fff}.elementor-widget-text-editor.elementor-drop-cap-view-framed .elementor-drop-cap{color:#69727d;border:3px solid;background-color:transparent}.elementor-widget-text-editor:not(.elementor-drop-cap-view-default) .elementor-drop-cap{margin-top:8px}.elementor-widget-text-editor:not(.elementor-drop-cap-view-default) .elementor-drop-cap-letter{width:1em;height:1em}.elementor-widget-text-editor .elementor-drop-cap{float:left;text-align:center;line-height:1;font-size:50px}.elementor-widget-text-editor .elementor-drop-cap-letter{display:inline-block}<\/style>\t\t\t\t<p><span style=\"font-weight: 400;\">Les origines de la <strong>recherche dichotomique<\/strong> se retrouvent dans les travaux math\u00e9matiques antiques : les bases de cette m\u00e9thode ont \u00e9t\u00e9 \u00e9tablies, comme pour la plupart des choses, d\u00e8s l&rsquo;Antiquit\u00e9 par des penseurs grecs, notamment le c\u00e9l\u00e8bre\u00a0 philosophe et math\u00e9maticien <strong>Euclide<\/strong> qui a v\u00e9cu vers 300 avant notre \u00e8re.<\/span><\/p><p><span style=\"font-weight: 400;\">En tant qu\u2019algorithme de recherche efficace, la recherche dichotomique a \u00e9t\u00e9 d\u00e9velopp\u00e9e plus tard, au XXe si\u00e8cle, avec l\u2019arriv\u00e9e de l\u2019informatique et l&rsquo;algorithmique. La toute premi\u00e8re allusion \u00e0 cette m\u00e9thode est souvent attribu\u00e9e \u00e0 l\u2019informaticien am\u00e9ricain John W. Mauchy en 1946 dans ses <\/span><i><span style=\"font-weight: 400;\">Moore School Lectures<\/span><\/i><span style=\"font-weight: 400;\">. Mauchy est aussi reconnu pour avoir d\u00e9velopp\u00e9 le premier ordinateur \u00e9lectronique \u00e0 grande \u00e9chelle, l\u2019<strong>ENIAC<\/strong> (Electronic Numerical Integrator and Computer) avec J. Presper Eckert.<\/span><\/p><p><span style=\"font-weight: 400;\">La recherche dichotomique a ensuite \u00e9t\u00e9 formalis\u00e9e et popularis\u00e9e par Donald Knuth dans son ouvrage <\/span><i><span style=\"font-weight: 400;\">The art of Computer Programming <\/span><\/i><span style=\"font-weight: 400;\">(L\u2019art de la programmation informatique). Les premi\u00e8res \u00e9ditions de cet ouvrage, publi\u00e9es dans les ann\u00e9es 1960, ont grandement contribu\u00e9 \u00e0 l\u2019\u00e9tablissement de <strong>la recherche dichotomique comme technique d\u2019exploration de donn\u00e9es fondamentale<\/strong>, largement utilis\u00e9e dans le domaine de l\u2019informatique.<\/span><\/p><p><span style=\"font-weight: 400;\">Aujourd\u2019hui, la conception \u00e9l\u00e9gante et sa performance sup\u00e9rieure par rapport \u00e0 d\u2019autres m\u00e9thodes de recherche ont fait de la recherche dichotomique <strong>une technique incontournable pour de nombreuses applications informatiques et scientifiques<\/strong>.<\/span><\/p>\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-5f58b6f elementor-widget elementor-widget-image\" data-id=\"5f58b6f\" data-element_type=\"widget\" data-widget_type=\"image.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<style>\/*! elementor - v3.15.0 - 02-08-2023 *\/\n.elementor-widget-image{text-align:center}.elementor-widget-image a{display:inline-block}.elementor-widget-image a img[src$=\".svg\"]{width:48px}.elementor-widget-image img{vertical-align:middle;display:inline-block}<\/style>\t\t\t\t\t\t\t\t\t\t\t\t<img decoding=\"async\" width=\"595\" height=\"550\" src=\"https:\/\/datascientest.com\/wp-content\/uploads\/2023\/10\/recherche-dichotomique-1.jpg\" class=\"attachment-full size-full wp-image-219695\" alt=\"\" srcset=\"https:\/\/datascientest.com\/wp-content\/uploads\/2023\/10\/recherche-dichotomique-1.jpg 595w, https:\/\/datascientest.com\/wp-content\/uploads\/2023\/10\/recherche-dichotomique-1-300x277.jpg 300w\" sizes=\"(max-width: 595px) 100vw, 595px\" \/>\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-70b894f elementor-align-center button-principale elementor-widget elementor-widget-button\" data-id=\"70b894f\" data-element_type=\"widget\" data-widget_type=\"button.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t<div class=\"elementor-button-wrapper\">\n\t\t\t<a class=\"elementor-button elementor-button-link elementor-size-sm elementor-animation-grow\" href=\"https:\/\/datascientest.com\/formation-data-scientist\">\n\t\t\t\t\t\t<span class=\"elementor-button-content-wrapper\">\n\t\t\t\t\t\t<span class=\"elementor-button-text\">En savoir plus sur la recherche dichotomique<\/span>\n\t\t<\/span>\n\t\t\t\t\t<\/a>\n\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t<div class=\"elementor-element elementor-element-9214e25 e-flex e-con-boxed e-con\" data-id=\"9214e25\" data-element_type=\"container\" data-settings=\"{&quot;content_width&quot;:&quot;boxed&quot;}\">\n\t\t\t\t\t<div class=\"e-con-inner\">\n\t\t\t\t<div class=\"elementor-element elementor-element-a21f202 elementor-widget elementor-widget-heading\" data-id=\"a21f202\" data-element_type=\"widget\" data-widget_type=\"heading.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<h3 class=\"elementor-heading-title elementor-size-default\">Comment cela fonctionne ? <\/h3>\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-3cdc3a1 elementor-widget elementor-widget-text-editor\" data-id=\"3cdc3a1\" data-element_type=\"widget\" data-widget_type=\"text-editor.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t<p><span style=\"font-weight: 400;\">De fa\u00e7on g\u00e9n\u00e9rale, la recherche dichotomique s\u2019applique \u00e0 un tableau tri\u00e9 en divisant continuellement l\u2019intervalle de recherche en deux de sorte que l\u2019espace de recherche se r\u00e9duit \u00e0 chaque it\u00e9ration. Ainsi, cette m\u00e9thode a une performance bien meilleure que celle de la recherche lin\u00e9aire, en particulier lorsque les volumes des donn\u00e9es sont importants.\u00a0<\/span><\/p><p><span style=\"font-weight: 400;\">Pour garantir le bon fonctionnement de la recherche binaire, il est importante de v\u00e9rifier les conditions suivantes:<\/span><\/p><ul><li><b>Donn\u00e9es tri\u00e9es: <\/b><span style=\"font-weight: 400;\">La recherche binaire ne peut \u00eatre utilis\u00e9e que sur un ensemble de donn\u00e9es tri\u00e9es, que ce soit dans l\u2019ordre croissant ou d\u00e9croissant.\u00a0<\/span><\/li><li><b>Structure indexable: <\/b><span style=\"font-weight: 400;\">L&rsquo;impl\u00e9mentation est plus facile lorsqu\u2019il s\u2019agit des structures de donn\u00e9es indexables, telles que les tableaux ou les listes cha\u00een\u00e9es avec acc\u00e8s direct aux \u00e9l\u00e9ments par index.<\/span><\/li><li><b>Taille statique: <\/b><span style=\"font-weight: 400;\">Si le tableau est fr\u00e9quemment modifi\u00e9, la recherche binaire pourrait devenir moins avantageuse car il faudrait r\u00e9ajuster le tableau \u00e0 chaque modification.<\/span><\/li><li><b><\/b><b>Comparabilit\u00e9 des \u00e9l\u00e9ments: <\/b><span style=\"font-weight: 400;\">Des op\u00e9rations de\u00a0 comparaison comme \u00ab\u00a0plus petit que\u00a0\u00bb, \u00ab\u00a0plus grand que\u00a0\u00bb ou \u00ab\u00a0\u00e9gal que\u00a0\u00bb peuvent \u00eatre \u00e9tablies entre les \u00e9l\u00e9ments.<\/span><\/li><\/ul>\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-b8f2a06 elementor-widget elementor-widget-text-editor\" data-id=\"b8f2a06\" data-element_type=\"widget\" data-widget_type=\"text-editor.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t<p><span style=\"font-weight: 400;\">Pour commencer, parcourons les \u00e9tapes de cette m\u00e9thode avec un exemple. Apr\u00e8s ceci on donnera un code pour son impl\u00e9mentation it\u00e9rative et r\u00e9cursive.<\/span><\/p><p><span style=\"font-weight: 400;\">1. Consid\u00e9rons le tableau suivant :<\/span><\/p><p style=\"text-align: center;\">\ud835\udc4e\ud835\udc5f\ud835\udc5f\ud835\udc4e\ud835\udc66 = [2, 8, 13, 28, 45, 56, 79, 84, 95, 102]<\/p><p>Et supposons que l&rsquo;on cherche l&rsquo;\u00e9l\u00e9ment \ud835\udc65 = 79.<\/p><p><span style=\"font-weight: 400;\">2. On initialise deux pointeurs avec l\u2019index premi\u00e8re et la derni\u00e8re position de notre tableau, dans notre cas on aura \ud835\udc59\ud835\udc5c\ud835\udc64 = 0 et \u210e\ud835\udc56\ud835\udc54\u210e = 9.<\/span><\/p><p><span style=\"font-weight: 400;\">3. On calcule l\u2019index qui se trouve au milieu et on compare son \u00e9l\u00e9ment \u00e0 <\/span><span style=\"font-weight: 400;\"> \ud835\udc65 = 79<\/span><span style=\"font-weight: 400;\">. <\/span><span style=\"font-weight: 400;\">Si notre <\/span><span style=\"font-weight: 400;\"> \ud835\udc65<\/span><span style=\"font-weight: 400;\">\u00a0est \u00e9gal \u00e0 l\u2019\u00e9l\u00e9ment au milieu on aura termin\u00e9. Si <\/span><span style=\"font-weight: 400;\"> \ud835\udc65<\/span><span style=\"font-weight: 400;\"> est plus petit, on d\u00e9place le champ de recherche vers la gauche, sinon on le d\u00e9place vers la droite.<\/span><\/p><p>De sorte que pour notre exemple on a dans un premier temps :<\/p><p style=\"text-align: center;\">\ud835\udc65 = 79<br \/>\ud835\udc59\ud835\udc5c\ud835\udc64 = 0<br \/>\u210e\ud835\udc56\ud835\udc54\u210e = 9<br \/>\ud835\udc5a\ud835\udc56\ud835\udc51 = 4<br \/>\ud835\udc4e\ud835\udc5f\ud835\udc5f\ud835\udc4e\ud835\udc66[\ud835\udc5a\ud835\udc56\ud835\udc51] = 45<\/p><p><span style=\"font-weight: 400;\">Comme \ud835\udc4e\ud835\udc5f\ud835\udc5f\ud835\udc4e\ud835\udc66[\ud835\udc5a\ud835\udc56\ud835\udc51] = 45 &lt; 79 = \ud835\udc65<\/span><span style=\"font-weight: 400;\">, on d\u00e9place le champ de recherche vers la droite et on r\u00e9initialise le pointeur \ud835\udc59\ud835\udc5c\ud835\udc64<\/span><span style=\"font-weight: 400;\">\u00a0comme: <\/span><span style=\"font-weight: 400;\"> \ud835\udc59\ud835\udc5c\ud835\udc64 = \ud835\udc5a\ud835\udc56\ud835\udc51 + 1<\/span><span style=\"font-weight: 400;\">. Le pointeur <\/span><span style=\"font-weight: 400;\">high <\/span><span style=\"font-weight: 400;\">reste pareil.<br \/><\/span><\/p><p><span style=\"font-weight: 400;\">Notre champ de recherche est d\u00e9sormais d\u00e9limit\u00e9 par les chiffres en bleue:<\/span><\/p><p style=\"text-align: center;\"><span style=\"font-weight: 400;\">\ud835\udc4e\ud835\udc5f\ud835\udc5f\ud835\udc4e\ud835\udc66 = [2, 8, 13, 28, 45, <span style=\"color: #008080;\">56, 79, 84, 95, 102]<\/span><\/span><\/p><p><span style=\"font-weight: 400;\">4. On r\u00e9p\u00e8te la 3\u00e8me \u00e9tape de sorte qu\u2019on a :<\/span><\/p><p style=\"text-align: center;\">\ud835\udc65 = 79<br \/>\ud835\udc59\ud835\udc5c\ud835\udc64 = 5<br \/>\u210e\ud835\udc56\ud835\udc54\u210e = 9<br \/>\ud835\udc5a\ud835\udc56\ud835\udc51 = 7<br \/>\ud835\udc4e\ud835\udc5f\ud835\udc5f\ud835\udc4e\ud835\udc66[\ud835\udc5a\ud835\udc56\ud835\udc51] = 84<\/p><p><span style=\"font-weight: 400;\">Comme \ud835\udc4e\ud835\udc5f\ud835\udc5f\ud835\udc4e\ud835\udc66[\ud835\udc5a\ud835\udc56\ud835\udc51] = 84 &gt; 79 = \ud835\udc65<\/span><span style=\"font-weight: 400;\">, on d\u00e9place le champ de recherche vers la gauche et r\u00e9initialise le pointeur <\/span><span style=\"font-weight: 400;\">high<\/span><span style=\"font-weight: 400;\"> comme: <\/span><span style=\"font-weight: 400;\"> \u210e\ud835\udc56\ud835\udc54\u210e = \ud835\udc5a\ud835\udc56\ud835\udc51 &#8211; 1<\/span><span style=\"font-weight: 400;\">. Le pointeur \ud835\udc59\ud835\udc5c\ud835\udc64<\/span><span style=\"font-weight: 400;\">\u00a0reste pareil.<\/span><\/p><p><span style=\"font-weight: 400;\">Notre champ de recherche est d\u00e9sormais :<\/span><\/p><p style=\"text-align: center;\">\ud835\udc4e\ud835\udc5f\ud835\udc5f\ud835\udc4e\ud835\udc66 = [2, 8, 13, 28, 45, <span style=\"color: #008080;\">56, 79,<\/span> 84, 95, 102<span style=\"color: #008080;\">]<\/span><\/p><p><span style=\"font-weight: 400;\">5. On r\u00e9p\u00e8te la 3\u00e8me \u00e9tape de sorte qu\u2019on a :<\/span><\/p><p style=\"text-align: center;\">\ud835\udc65 = 79<br \/>\ud835\udc59\ud835\udc5c\ud835\udc64 = 5<br \/>\u210e\ud835\udc56\ud835\udc54\u210e = 6<br \/>\ud835\udc5a\ud835\udc56\ud835\udc51 = 6<br \/>\ud835\udc4e\ud835\udc5f\ud835\udc5f\ud835\udc4e\ud835\udc66[\ud835\udc5a\ud835\udc56\ud835\udc51] = 79<\/p><p><span style=\"font-weight: 400;\">6. Puisque \ud835\udc4e\ud835\udc5f\ud835\udc5f\ud835\udc4e\ud835\udc66[\ud835\udc5a\ud835\udc56\ud835\udc51] = 79 = 79 = \ud835\udc65<\/span><span style=\"font-weight: 400;\">,<\/span> <span style=\"font-weight: 400;\">on a trouv\u00e9 l\u2019\u00e9l\u00e9ment recherch\u00e9 et on s\u2019arr\u00eate.<\/span><\/p><p>La m\u00e9thode continue jusqu\u2019\u00e0 ce que l\u2019\u00e9l\u00e9ment est trouv\u00e9 o\u00f9 l\u2019espace de recherche \u00e9puis\u00e9e.<\/p>\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-6c3b6c7 elementor-align-center button-principale elementor-widget elementor-widget-button\" data-id=\"6c3b6c7\" data-element_type=\"widget\" data-widget_type=\"button.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t<div class=\"elementor-button-wrapper\">\n\t\t\t<a class=\"elementor-button elementor-button-link elementor-size-sm elementor-animation-grow\" href=\"https:\/\/datascientest.com\/formation-data-scientist\">\n\t\t\t\t\t\t<span class=\"elementor-button-content-wrapper\">\n\t\t\t\t\t\t<span class=\"elementor-button-text\">Ma\u00eetriser la recherche dichotomique<\/span>\n\t\t<\/span>\n\t\t\t\t\t<\/a>\n\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t<div class=\"elementor-element elementor-element-c2ce79b e-flex e-con-boxed e-con\" data-id=\"c2ce79b\" data-element_type=\"container\" data-settings=\"{&quot;content_width&quot;:&quot;boxed&quot;}\">\n\t\t\t\t\t<div class=\"e-con-inner\">\n\t\t\t\t<div class=\"elementor-element elementor-element-94b155f elementor-widget elementor-widget-heading\" data-id=\"94b155f\" data-element_type=\"widget\" data-widget_type=\"heading.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<h3 class=\"elementor-heading-title elementor-size-default\"><u>Le code<\/u><\/h3>\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-c37147b elementor-widget elementor-widget-heading\" data-id=\"c37147b\" data-element_type=\"widget\" data-widget_type=\"heading.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<h4 class=\"elementor-heading-title elementor-size-medium\">M\u00e9thode it\u00e9rative<\/h4>\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-e525ceb elementor-widget elementor-widget-text-editor\" data-id=\"e525ceb\" data-element_type=\"widget\" data-widget_type=\"text-editor.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t<div style=\"padding-left: 40px;\">\ud835\udc64\u210e\ud835\udc56\ud835\udc59\ud835\udc52 \ud835\udc59\ud835\udc5c\ud835\udc64 &lt;= \u210e\ud835\udc56\ud835\udc54\u210e<\/div><div style=\"padding-left: 40px;\">\ud835\udc5a\ud835\udc56\ud835\udc51 = \ud835\udc59\ud835\udc5c\ud835\udc64 + (\u210e\ud835\udc56\ud835\udc54\u210e &#8211; \ud835\udc59\ud835\udc5c\ud835\udc64) \/\/ 2<\/div><div style=\"padding-left: 40px;\">\ud835\udc56\ud835\udc53 \ud835\udc4e\ud835\udc5f\ud835\udc5f\ud835\udc4e\ud835\udc66[\ud835\udc5a\ud835\udc56\ud835\udc51] == \ud835\udc65:<\/div><div style=\"padding-left: 40px;\">\ud835\udc5f\ud835\udc52\ud835\udc61\ud835\udc62\ud835\udc5f\ud835\udc5b \ud835\udc5a\ud835\udc56\ud835\udc51 # \ud835\udc65 \ud835\udc52\ud835\udc60\ud835\udc61 \u00e9\ud835\udc54\ud835\udc4e\ud835\udc59 \u00e0 \ud835\udc59\u2019\u00e9\ud835\udc59\u00e9\ud835\udc5a\ud835\udc52\ud835\udc5b\ud835\udc61 \ud835\udc4e\ud835\udc62\u00a0<\/div><div style=\"padding-left: 40px;\">\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 # \ud835\udc5a\ud835\udc56\ud835\udc59\ud835\udc56\ud835\udc52\ud835\udc62, \ud835\udc5c\ud835\udc5b \ud835\udc5f\ud835\udc52\ud835\udc5b\ud835\udc63\ud835\udc5c\ud835\udc56\ud835\udc52 \ud835\udc59\u2019\ud835\udc56\ud835\udc5b\ud835\udc51\ud835\udc52\ud835\udc65<\/div><div style=\"padding-left: 40px;\">\ud835\udc52\ud835\udc59\ud835\udc56\ud835\udc53 \ud835\udc4e\ud835\udc5f\ud835\udc5f\ud835\udc4e\ud835\udc66[\ud835\udc5a\ud835\udc56\ud835\udc51] &lt; \ud835\udc65:<\/div><div style=\"padding-left: 40px;\">\ud835\udc59\ud835\udc5c\ud835\udc64 = \ud835\udc5a\ud835\udc56\ud835\udc51 + 1# \ud835\udc65 \ud835\udc52\ud835\udc60\ud835\udc61 \ud835\udc5d\ud835\udc59\ud835\udc62\ud835\udc60 \ud835\udc54\ud835\udc5f\ud835\udc4e\ud835\udc5b\ud835\udc51 \ud835\udc5e\ud835\udc62\ud835\udc52 \ud835\udc59\u2019\u00e9\ud835\udc59\u00e9\ud835\udc5a\ud835\udc52\ud835\udc5b\ud835\udc61\u00a0<\/div><div style=\"padding-left: 40px;\">\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 # \ud835\udc4e\ud835\udc62 \ud835\udc5a\ud835\udc56\ud835\udc59\ud835\udc56\ud835\udc52\ud835\udc62, \ud835\udc5c\ud835\udc5b \ud835\udc56\ud835\udc54\ud835\udc5b\ud835\udc5c\ud835\udc5f\ud835\udc52 \ud835\udc59\ud835\udc4e \ud835\udc5a\ud835\udc5c\ud835\udc56\ud835\udc61\ud835\udc56\u00e9\u00a0 \u00a0 \u00a0 \u00a0<\/div><div style=\"padding-left: 40px;\">\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 # \ud835\udc54\ud835\udc4e\ud835\udc62\ud835\udc50\u210e\ud835\udc52<\/div><div style=\"padding-left: 40px;\">\ud835\udc52\ud835\udc59\ud835\udc60\ud835\udc52:<\/div><div style=\"padding-left: 40px;\">\u210e\ud835\udc56\ud835\udc54\u210e = \ud835\udc5a\ud835\udc56\ud835\udc51 &#8211; 1# \ud835\udc65 \ud835\udc52\ud835\udc60\ud835\udc61 \ud835\udc5d\ud835\udc59\ud835\udc62\ud835\udc60 \ud835\udc5d\ud835\udc52\ud835\udc61\ud835\udc56\ud835\udc61 \ud835\udc5e\ud835\udc62\ud835\udc52 \ud835\udc59\u2019\u00e9\ud835\udc59\u00e9\ud835\udc5a\ud835\udc52\ud835\udc5b\ud835\udc61\u00a0<\/div><div style=\"padding-left: 40px;\">\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 # \ud835\udc4e\ud835\udc62 \ud835\udc5a\ud835\udc56\ud835\udc59\ud835\udc56\ud835\udc52\ud835\udc62, \ud835\udc5c\ud835\udc5b \ud835\udc56\ud835\udc54\ud835\udc5b\ud835\udc5c\ud835\udc5f\ud835\udc52 \ud835\udc59\ud835\udc4e \ud835\udc5a\ud835\udc5c\ud835\udc56\ud835\udc61\ud835\udc56\u00e9\u00a0<\/div><div style=\"padding-left: 40px;\">\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 # \ud835\udc51\ud835\udc5f\ud835\udc5c\ud835\udc56\ud835\udc61\ud835\udc52<\/div><div style=\"padding-left: 40px;\">\ud835\udc5f\ud835\udc52\ud835\udc61\ud835\udc62\ud835\udc5f\ud835\udc5b -1 # \ud835\udc4e\ud835\udc62 \ud835\udc50\ud835\udc4e\ud835\udc60 \ud835\udc5c\u00f9 \ud835\udc59\u2019\u00e9\ud835\udc59\u00e9\ud835\udc5a\ud835\udc52\ud835\udc5b\ud835\udc61 \ud835\udc5b\u2019\ud835\udc4e \ud835\udc5d\ud835\udc4e\ud835\udc60 \u00e9\ud835\udc61\u00e9 \ud835\udc61\ud835\udc5f\ud835\udc5c\ud835\udc62\ud835\udc63\u00e9<\/div>\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-ddac523 elementor-widget elementor-widget-heading\" data-id=\"ddac523\" data-element_type=\"widget\" data-widget_type=\"heading.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<h4 class=\"elementor-heading-title elementor-size-medium\">M\u00e9thode r\u00e9cursive<\/h4>\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-22e06e7 elementor-widget elementor-widget-text-editor\" data-id=\"22e06e7\" data-element_type=\"widget\" data-widget_type=\"text-editor.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t<div style=\"padding-left: 40px;\">\ud835\udc4f\ud835\udc56\ud835\udc5b\ud835\udc4e\ud835\udc5f\ud835\udc66\ud835\udc46\ud835\udc52\ud835\udc4e\ud835\udc5f\ud835\udc50\u210e(\ud835\udc4e\ud835\udc5f\ud835\udc5f\ud835\udc4e\ud835\udc66, \ud835\udc59\ud835\udc5c\ud835\udc64, \u210e\ud835\udc56\ud835\udc54\u210e, \ud835\udc65):<\/div><div style=\"padding-left: 40px;\">\ud835\udc56\ud835\udc53 \u210e\ud835\udc56\ud835\udc54\u210e &gt;= \ud835\udc59\ud835\udc5c\ud835\udc64:<\/div><div style=\"padding-left: 40px;\">\ud835\udc5a\ud835\udc56\ud835\udc51 = \ud835\udc59\ud835\udc5c\ud835\udc64 + (\u210e\ud835\udc56\ud835\udc54\u210e &#8211; \ud835\udc59\ud835\udc5c\ud835\udc64) \/\/ 2<\/div><div style=\"padding-left: 40px;\">\ud835\udc56\ud835\udc53 \ud835\udc4e\ud835\udc5f\ud835\udc5f\ud835\udc4e\ud835\udc66[\ud835\udc5a\ud835\udc56\ud835\udc51] == \ud835\udc65:<\/div><div style=\"padding-left: 40px;\">\ud835\udc5f\ud835\udc52\ud835\udc61\ud835\udc62\ud835\udc5f\ud835\udc5b \ud835\udc5a\ud835\udc56\ud835\udc51 # \ud835\udc65 \ud835\udc52\ud835\udc60\ud835\udc61 \u00e9\ud835\udc54\ud835\udc4e\ud835\udc59 \u00e0 \ud835\udc59\u2019\u00e9\ud835\udc59\u00e9\ud835\udc5a\ud835\udc52\ud835\udc5b\ud835\udc61 \ud835\udc4e\ud835\udc62 \ud835\udc5a\ud835\udc56\ud835\udc59\ud835\udc56\ud835\udc52\ud835\udc62,<\/div><div style=\"padding-left: 40px;\">\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 # \ud835\udc5c\ud835\udc5b \ud835\udc5f\ud835\udc52\ud835\udc5b\ud835\udc63\ud835\udc5c\ud835\udc56\ud835\udc52 \ud835\udc59\u2019\ud835\udc56\ud835\udc5b\ud835\udc51\ud835\udc52\ud835\udc65<\/div><div style=\"padding-left: 40px;\">\ud835\udc52\ud835\udc59\ud835\udc56\ud835\udc53 \ud835\udc4e\ud835\udc5f\ud835\udc5f\ud835\udc4e\ud835\udc66[\ud835\udc5a\ud835\udc56\ud835\udc51] +1:<\/div><div style=\"padding-left: 40px;\">\ud835\udc5f\ud835\udc52\ud835\udc61\ud835\udc62\ud835\udc5f\ud835\udc5b \ud835\udc4f\ud835\udc56\ud835\udc5b\ud835\udc4e\ud835\udc5f\ud835\udc66\ud835\udc46\ud835\udc52\ud835\udc4e\ud835\udc5f\ud835\udc50\u210e(\ud835\udc4e\ud835\udc5f\ud835\udc5f\ud835\udc4e\ud835\udc66, \ud835\udc5a\ud835\udc56\ud835\udc51 +1, \u210e\ud835\udc56\ud835\udc54\u210e, \ud835\udc65)<\/div><div style=\"padding-left: 40px;\">\ud835\udc52\ud835\udc59\ud835\udc60\ud835\udc52:<\/div><div style=\"padding-left: 40px;\">\ud835\udc5f\ud835\udc52\ud835\udc61\ud835\udc62\ud835\udc5f\ud835\udc5b \ud835\udc4f\ud835\udc56\ud835\udc5b\ud835\udc4e\ud835\udc5f\ud835\udc66\ud835\udc46\ud835\udc52\ud835\udc4e\ud835\udc5f\ud835\udc50\u210e(\ud835\udc4e\ud835\udc5f\ud835\udc5f\ud835\udc4e\ud835\udc66, \ud835\udc59\ud835\udc5c\ud835\udc64, \ud835\udc5a\ud835\udc56\ud835\udc51 -1, \ud835\udc65)<\/div><div style=\"padding-left: 40px;\">\ud835\udc52\ud835\udc59\ud835\udc60\ud835\udc52:<\/div><div style=\"padding-left: 40px;\">\u00a0 \u00a0 \u00a0\ud835\udc5f\ud835\udc52\ud835\udc61\ud835\udc62\ud835\udc5f\ud835\udc5b -1 # \ud835\udc4e\ud835\udc62 \ud835\udc50\ud835\udc4e\ud835\udc60 \ud835\udc5c\u00f9 \ud835\udc59\u2019\u00e9\ud835\udc59\u00e9\ud835\udc5a\ud835\udc52\ud835\udc5b\ud835\udc61 \ud835\udc5b\u2019\ud835\udc4e \ud835\udc5d\ud835\udc4e\ud835\udc60 \u00e9\ud835\udc61\u00e9\u00a0<\/div><div style=\"padding-left: 40px;\">\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 # \ud835\udc61\ud835\udc5f\ud835\udc5c\ud835\udc62\ud835\udc63\u00e9<\/div>\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t<div class=\"elementor-element elementor-element-327046a e-flex e-con-boxed e-con\" data-id=\"327046a\" data-element_type=\"container\" data-settings=\"{&quot;content_width&quot;:&quot;boxed&quot;}\">\n\t\t\t\t\t<div class=\"e-con-inner\">\n\t\t\t\t<div class=\"elementor-element elementor-element-0e575ed elementor-widget elementor-widget-heading\" data-id=\"0e575ed\" data-element_type=\"widget\" data-widget_type=\"heading.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<h3 class=\"elementor-heading-title elementor-size-default\">Complexit\u00e9 algorithmique<\/h3>\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-919f7fe elementor-widget elementor-widget-text-editor\" data-id=\"919f7fe\" data-element_type=\"widget\" data-widget_type=\"text-editor.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t<p><span style=\"font-weight: 400;\">Dans le pire des cas, la complexit\u00e9 de l&rsquo;algorithme est de \ud835\udc42(\ud835\udc59\ud835\udc5c\ud835\udc54(\ud835\udc5b)), o\u00f9 \ud835\udc5b est le nombre d\u2019\u00e9l\u00e9ments dans la liste, ce qui fait de la recherche dichotomique une m\u00e9thode tr\u00e8s efficace, particuli\u00e8rement pour les grandes listes tri\u00e9es.<\/span><\/p>\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t<div class=\"elementor-element elementor-element-f251319 e-flex e-con-boxed e-con\" data-id=\"f251319\" data-element_type=\"container\" data-settings=\"{&quot;content_width&quot;:&quot;boxed&quot;}\">\n\t\t\t\t\t<div class=\"e-con-inner\">\n\t\t\t\t<div class=\"elementor-element elementor-element-75dd140 elementor-widget elementor-widget-heading\" data-id=\"75dd140\" data-element_type=\"widget\" data-widget_type=\"heading.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<h3 class=\"elementor-heading-title elementor-size-default\">Avantages<\/h3>\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-ca5d3f6 elementor-widget elementor-widget-text-editor\" data-id=\"ca5d3f6\" data-element_type=\"widget\" data-widget_type=\"text-editor.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t<ol><li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">Efficacit\u00e9 en termes de temps : il est plus rapide que la recherche lin\u00e9aire, en particulier pour les grandes listes.<\/span><\/li><li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">Simple \u00e0 comprendre et \u00e0 impl\u00e9menter.<\/span><\/li><li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">Adaptable dans des divers contextes, tels que la recherche dans des tableaux, des listes cha\u00een\u00e9es, des arbres binaires de recherche, etc.<\/span><\/li><\/ol>\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t<div class=\"elementor-element elementor-element-0245a39 e-flex e-con-boxed e-con\" data-id=\"0245a39\" data-element_type=\"container\" data-settings=\"{&quot;content_width&quot;:&quot;boxed&quot;}\">\n\t\t\t\t\t<div class=\"e-con-inner\">\n\t\t\t\t<div class=\"elementor-element elementor-element-6a0328e elementor-widget elementor-widget-heading\" data-id=\"6a0328e\" data-element_type=\"widget\" data-widget_type=\"heading.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<h3 class=\"elementor-heading-title elementor-size-default\">Limitations<\/h3>\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-59399fd elementor-widget elementor-widget-text-editor\" data-id=\"59399fd\" data-element_type=\"widget\" data-widget_type=\"text-editor.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t<ol><li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">Le tableau doit \u00eatre tri\u00e9.<\/span><\/li><li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">Les \u00e9l\u00e9ments du tableau doivent \u00eatre comparables.<\/span><\/li><\/ol>\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t<div class=\"elementor-element elementor-element-3c8c6c9 e-flex e-con-boxed e-con\" data-id=\"3c8c6c9\" data-element_type=\"container\" data-settings=\"{&quot;content_width&quot;:&quot;boxed&quot;}\">\n\t\t\t\t\t<div class=\"e-con-inner\">\n\t\t\t\t<div class=\"elementor-element elementor-element-3337d32 elementor-widget elementor-widget-heading\" data-id=\"3337d32\" data-element_type=\"widget\" data-widget_type=\"heading.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<h3 class=\"elementor-heading-title elementor-size-default\">Quelques applications<\/h3>\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-9e93cde elementor-widget elementor-widget-text-editor\" data-id=\"9e93cde\" data-element_type=\"widget\" data-widget_type=\"text-editor.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t<p><span style=\"font-weight: 400;\">La recherche dichotomique est tr\u00e8s utile lors de la <strong>cr\u00e9ation des algorithmes<\/strong> plus complexes utilis\u00e9s en <a href=\"https:\/\/datascientest.com\/machine-learning-tout-savoir\">Machine Learning<\/a>, par exemple dans des algorithmes d\u2019entra\u00eenement de r\u00e9seaux des neurones o\u00f9 pour trouver les hyperparam\u00e8tres optimaux d\u2019un mod\u00e8le.<\/span><\/p><p><span style=\"font-weight: 400;\">Elle peut \u00eatre utilis\u00e9e aussi pour faire des <strong>recherches dans une base de donn\u00e9es volumineuse<\/strong> <strong>ou en graphiques informatiques<\/strong> comme la cartographie de textures.<\/span><\/p>\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-3a2828e elementor-widget elementor-widget-image\" data-id=\"3a2828e\" data-element_type=\"widget\" data-widget_type=\"image.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<img decoding=\"async\" width=\"625\" height=\"550\" src=\"https:\/\/datascientest.com\/wp-content\/uploads\/2023\/10\/recherche-dichotomique-2.jpg\" class=\"attachment-full size-full wp-image-219699\" alt=\"\" srcset=\"https:\/\/datascientest.com\/wp-content\/uploads\/2023\/10\/recherche-dichotomique-2.jpg 625w, https:\/\/datascientest.com\/wp-content\/uploads\/2023\/10\/recherche-dichotomique-2-300x264.jpg 300w\" sizes=\"(max-width: 625px) 100vw, 625px\" \/>\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-79de7df elementor-align-center button-principale elementor-widget elementor-widget-button\" data-id=\"79de7df\" data-element_type=\"widget\" data-widget_type=\"button.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t<div class=\"elementor-button-wrapper\">\n\t\t\t<a class=\"elementor-button elementor-button-link elementor-size-sm elementor-animation-grow\" href=\"https:\/\/datascientest.com\/formation-data-scientist\">\n\t\t\t\t\t\t<span class=\"elementor-button-content-wrapper\">\n\t\t\t\t\t\t<span class=\"elementor-button-text\">Se former \u00e0 la recherche dichotomique<\/span>\n\t\t<\/span>\n\t\t\t\t\t<\/a>\n\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t<div class=\"elementor-element elementor-element-5aca634 e-flex e-con-boxed e-con\" data-id=\"5aca634\" data-element_type=\"container\" data-settings=\"{&quot;content_width&quot;:&quot;boxed&quot;}\">\n\t\t\t\t\t<div class=\"e-con-inner\">\n\t\t\t\t<div class=\"elementor-element elementor-element-73a120f elementor-widget elementor-widget-html\" data-id=\"73a120f\" data-element_type=\"widget\" data-widget_type=\"html.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<script type=\"application\/ld+json\">\r\n{\r\n  \"@context\": \"https:\/\/schema.org\",\r\n  \"@type\": \"FAQPage\",\r\n  \"mainEntity\": [{\r\n    \"@type\": \"Question\",\r\n    \"name\": \"Les origines de la recherche dichtomique\",\r\n    \"acceptedAnswer\": {\r\n      \"@type\": \"Answer\",\r\n      \"text\": \"Les origines de la recherche dichotomique se retrouvent dans les travaux math\u00e9matiques antiques : les bases de cette m\u00e9thode ont \u00e9t\u00e9 \u00e9tablies, comme pour la plupart des choses, d\u00e8s l'Antiquit\u00e9 par des penseurs grecs, notamment le c\u00e9l\u00e8bre  philosophe et math\u00e9maticien Euclide qui a v\u00e9cu vers 300 avant notre \u00e8re.\"\r\n    }\r\n  },{\r\n    \"@type\": \"Question\",\r\n    \"name\": \"Comment cela fonctionne ?\",\r\n    \"acceptedAnswer\": {\r\n      \"@type\": \"Answer\",\r\n      \"text\": \"De fa\u00e7on g\u00e9n\u00e9rale, la recherche dichotomique s\u2019applique \u00e0 un tableau tri\u00e9 en divisant continuellement l\u2019intervalle de recherche en deux de sorte que l\u2019espace de recherche se r\u00e9duit \u00e0 chaque it\u00e9ration. Ainsi, cette m\u00e9thode a une performance bien meilleure que celle de la recherche lin\u00e9aire, en particulier lorsque les volumes des donn\u00e9es sont importants.\"\r\n    }\r\n  }]\r\n}\r\n<\/script>\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/div>\n\t\t","protected":false},"excerpt":{"rendered":"<p>Connue \u00e9galement sous le nom de recherche par moiti\u00e9, la recherche dichotomique est un algorithme puissant dans le domaine de l\u2019informatique et l\u2019algorithmique qui permet de trouver rapidement une valeur dans un ensemble de donn\u00e9es tri\u00e9es. Accrochez-vous pour d\u00e9couvrir en profondeur son fonctionnement, ses avantages et ses inconv\u00e9nients ainsi que ses applications. Les origines de [&hellip;]<\/p>\n","protected":false},"author":77,"featured_media":219648,"comment_status":"open","ping_status":"open","sticky":false,"template":"elementor_theme","format":"standard","meta":{"content-type":"","inline_featured_image":false},"categories":[2497],"tags":[],"yoast_head":"<!-- This site is optimized with the Yoast SEO Premium plugin v21.7 (Yoast SEO v21.7) - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>Binary search ou recherche dichotomique : Qu&#039;est-ce que c&#039;est ?<\/title>\n<meta name=\"description\" content=\"D\u00e9couvrez tout ce que vous devez savoir sur la recherche dichotomique, cet algorithme permettant de trouver rapidement une valeur dans un ensemble de donn\u00e9es.\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/datascientest.com\/binary-search-tout-savoir\" \/>\n<meta property=\"og:locale\" content=\"fr_FR\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Binary search ou recherche dichotomique : Qu&#039;est-ce que c&#039;est ?\" \/>\n<meta property=\"og:url\" content=\"https:\/\/datascientest.com\/binary-search-tout-savoir\" \/>\n<meta property=\"og:site_name\" content=\"Formation Data Science | DataScientest.com\" \/>\n<meta property=\"article:published_time\" content=\"2023-11-06T16:30:00+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2024-02-21T10:10:16+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/datascientest.com\/wp-content\/uploads\/2023\/10\/recherche-dichotomique.png\" \/>\n\t<meta property=\"og:image:width\" content=\"1200\" \/>\n\t<meta property=\"og:image:height\" content=\"600\" \/>\n\t<meta property=\"og:image:type\" content=\"image\/png\" \/>\n<meta name=\"author\" content=\"Raphael Kassel\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"\u00c9crit par\" \/>\n\t<meta name=\"twitter:data1\" content=\"Raphael Kassel\" \/>\n\t<meta name=\"twitter:label2\" content=\"Dur\u00e9e de lecture estim\u00e9e\" \/>\n\t<meta name=\"twitter:data2\" content=\"7 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\/\/datascientest.com\/binary-search-tout-savoir\",\"url\":\"https:\/\/datascientest.com\/binary-search-tout-savoir\",\"name\":\"Binary search ou recherche dichotomique : Qu'est-ce que c'est ?\",\"isPartOf\":{\"@id\":\"https:\/\/datascientest.com\/#website\"},\"datePublished\":\"2023-11-06T16:30:00+00:00\",\"dateModified\":\"2024-02-21T10:10:16+00:00\",\"author\":{\"@id\":\"https:\/\/datascientest.com\/#\/schema\/person\/6eca16f63daaafcbc96e15549b9d4ee1\"},\"description\":\"D\u00e9couvrez tout ce que vous devez savoir sur la recherche dichotomique, cet algorithme permettant de trouver rapidement une valeur dans un ensemble de donn\u00e9es.\",\"inLanguage\":\"fr-FR\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/datascientest.com\/binary-search-tout-savoir\"]}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/datascientest.com\/#website\",\"url\":\"https:\/\/datascientest.com\/\",\"name\":\"Formation Data Science | DataScientest.com\",\"description\":\"Leader de la formation en Data Science\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/datascientest.com\/?s={search_term_string}\"},\"query-input\":\"required name=search_term_string\"}],\"inLanguage\":\"fr-FR\"},{\"@type\":\"Person\",\"@id\":\"https:\/\/datascientest.com\/#\/schema\/person\/6eca16f63daaafcbc96e15549b9d4ee1\",\"name\":\"Raphael Kassel\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"fr-FR\",\"@id\":\"https:\/\/datascientest.com\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/datascientest.com\/wp-content\/uploads\/2023\/11\/raph.jpeg\",\"contentUrl\":\"https:\/\/datascientest.com\/wp-content\/uploads\/2023\/11\/raph.jpeg\",\"caption\":\"Raphael Kassel\"},\"description\":\"Raphael Kassel est le Head of Data Programs chez DataScientest. Il supervise une \u00e9quipe Data, impl\u00e9mente de nouveaux parcours comme \\\"Chef de projet IA\\\" et \\\"Data Product Manager\\\", et contribue \u00e0 la modernisation des op\u00e9rations du groupe. En collaboration \u00e9troite avec l'\u00e9quipe de d\u00e9veloppement, il adapte l'accompagnement acad\u00e9mique aux \u00e9volutions de l'\u00e9quipe data et \u00e0 l'internationalisation.\",\"sameAs\":[\"https:\/\/www.linkedin.com\/in\/raphaelkassel\/\",\"Data Science\"],\"url\":\"https:\/\/datascientest.com\/author\/raphaelkassel\"}]}<\/script>\n<!-- \/ Yoast SEO Premium plugin. -->","yoast_head_json":{"title":"Binary search ou recherche dichotomique : Qu'est-ce que c'est ?","description":"D\u00e9couvrez tout ce que vous devez savoir sur la recherche dichotomique, cet algorithme permettant de trouver rapidement une valeur dans un ensemble de donn\u00e9es.","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/datascientest.com\/binary-search-tout-savoir","og_locale":"fr_FR","og_type":"article","og_title":"Binary search ou recherche dichotomique : Qu'est-ce que c'est ?","og_url":"https:\/\/datascientest.com\/binary-search-tout-savoir","og_site_name":"Formation Data Science | DataScientest.com","article_published_time":"2023-11-06T16:30:00+00:00","article_modified_time":"2024-02-21T10:10:16+00:00","og_image":[{"width":1200,"height":600,"url":"https:\/\/datascientest.com\/wp-content\/uploads\/2023\/10\/recherche-dichotomique.png","type":"image\/png"}],"author":"Raphael Kassel","twitter_card":"summary_large_image","twitter_misc":{"\u00c9crit par":"Raphael Kassel","Dur\u00e9e de lecture estim\u00e9e":"7 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/datascientest.com\/binary-search-tout-savoir","url":"https:\/\/datascientest.com\/binary-search-tout-savoir","name":"Binary search ou recherche dichotomique : Qu'est-ce que c'est ?","isPartOf":{"@id":"https:\/\/datascientest.com\/#website"},"datePublished":"2023-11-06T16:30:00+00:00","dateModified":"2024-02-21T10:10:16+00:00","author":{"@id":"https:\/\/datascientest.com\/#\/schema\/person\/6eca16f63daaafcbc96e15549b9d4ee1"},"description":"D\u00e9couvrez tout ce que vous devez savoir sur la recherche dichotomique, cet algorithme permettant de trouver rapidement une valeur dans un ensemble de donn\u00e9es.","inLanguage":"fr-FR","potentialAction":[{"@type":"ReadAction","target":["https:\/\/datascientest.com\/binary-search-tout-savoir"]}]},{"@type":"WebSite","@id":"https:\/\/datascientest.com\/#website","url":"https:\/\/datascientest.com\/","name":"Formation Data Science | DataScientest.com","description":"Leader de la formation en Data Science","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/datascientest.com\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"fr-FR"},{"@type":"Person","@id":"https:\/\/datascientest.com\/#\/schema\/person\/6eca16f63daaafcbc96e15549b9d4ee1","name":"Raphael Kassel","image":{"@type":"ImageObject","inLanguage":"fr-FR","@id":"https:\/\/datascientest.com\/#\/schema\/person\/image\/","url":"https:\/\/datascientest.com\/wp-content\/uploads\/2023\/11\/raph.jpeg","contentUrl":"https:\/\/datascientest.com\/wp-content\/uploads\/2023\/11\/raph.jpeg","caption":"Raphael Kassel"},"description":"Raphael Kassel est le Head of Data Programs chez DataScientest. Il supervise une \u00e9quipe Data, impl\u00e9mente de nouveaux parcours comme \"Chef de projet IA\" et \"Data Product Manager\", et contribue \u00e0 la modernisation des op\u00e9rations du groupe. En collaboration \u00e9troite avec l'\u00e9quipe de d\u00e9veloppement, il adapte l'accompagnement acad\u00e9mique aux \u00e9volutions de l'\u00e9quipe data et \u00e0 l'internationalisation.","sameAs":["https:\/\/www.linkedin.com\/in\/raphaelkassel\/","Data Science"],"url":"https:\/\/datascientest.com\/author\/raphaelkassel"}]}},"_links":{"self":[{"href":"https:\/\/datascientest.com\/wp-json\/wp\/v2\/posts\/219647"}],"collection":[{"href":"https:\/\/datascientest.com\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/datascientest.com\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/datascientest.com\/wp-json\/wp\/v2\/users\/77"}],"replies":[{"embeddable":true,"href":"https:\/\/datascientest.com\/wp-json\/wp\/v2\/comments?post=219647"}],"version-history":[{"count":0,"href":"https:\/\/datascientest.com\/wp-json\/wp\/v2\/posts\/219647\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/datascientest.com\/wp-json\/wp\/v2\/media\/219648"}],"wp:attachment":[{"href":"https:\/\/datascientest.com\/wp-json\/wp\/v2\/media?parent=219647"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/datascientest.com\/wp-json\/wp\/v2\/categories?post=219647"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/datascientest.com\/wp-json\/wp\/v2\/tags?post=219647"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}