أينشتاين مصر (1) || شرح ال Grokking Algorithms - Binary Search скачать в хорошем качестве

أينشتاين مصر (1) || شرح ال Grokking Algorithms - Binary Search

Welcome to the first video of our captivating series, "Grokking Algorithms: Data Structures & Algorithms Level 1" on Egypt's Einstein channel! In this introductory episode, we dive straight into one of the most fundamental algorithms - Binary Search. 📺 Playlist Link:   • أينشتاين مصر || Grokking Algorithms in Arabic   Binary search is a powerful and efficient search technique, widely used in computer science and beyond. In this video, we unravel the secrets of how binary search efficiently locates a target value in a sorted dataset. We'll walk you through the step-by-step process of binary search, making it easy to understand even for those new to algorithms. Throughout the video, we'll demonstrate how binary search operates by repeatedly dividing the dataset in half, eliminating half of the remaining elements with each iteration. This divide-and-conquer approach enables binary search to find the target value in logarithmic time, making it much faster than traditional linear search methods. Moreover, we'll explore the concept of time complexity and explain how binary search achieves a remarkable time complexity of O(log n). Understanding time complexity is crucial in analyzing the efficiency of algorithms, and binary search serves as an excellent example to grasp this concept. Whether you're a beginner or an experienced programmer, this video caters to all levels of understanding. By the end of the episode, you'll have a solid grasp of binary search and its significance in problem-solving. Join us in this exhilarating start to our "Grokking Algorithms" series as we lay the foundation for an exciting journey through the world of data structures and algorithms. Don't forget to like, subscribe, and hit the notification bell to stay updated with the rest of the series. Let's embark on this quest to become algorithmic experts together! 🚀 ---------------------------------------------------------------------------------------------- محتوي الفيديو:- 00:00​ - مقدمة قناة أينشتاين مصر 00:07 - What is the mean of Search? 04:43 - Introduction to Binary Search 10:22 - Binary Search in detail 33:55 - Simple explanation of Logarithms 44:00 - Binary Search Game 46:53 - Part 1 Binary Search using Scratch 50:21 - How to implement the Binary Search algorithm 01:07:39 - Part 2 Binary Search using Scratch 01:18:49- Binary Search implementation using Python 01:22:32 - Binary Search Exercises 01:24:12 - Running time 01:26:52 - Comparisons and Summary of the Binary Search 01:28:43 - The End ---------------------------------------------------------------------------------------------- #أينشتاين_مصر #binarysearch #algorithm ╔═.♥. ════════════════════════════════════╗ ＳＵＢＳＣＲＩＢＥ | ＬＩＫＥ | ＣＯＭＭＥＮＴ | ＳＨＡＲＥ | ► Subscribe إشترك ✔    / @einshtenmisr   لاتنسوا الاشتـــــــراك في القنــــاة ✔ ولايـك للفيديو ✔ مشاهدة طيبة أعزائي الكرام ╚══════.♥. ═════════════════════════ #أينشتاين_مصر #Mahmoud_Alyosify https://MahmoudAlyosifySite.github.io/   / einshtenmisr     / mahmoudalyosify   Gmail:mahmoudalyosify@gmail.com Yahoo :mahmoudalyosify@yahoo.com