أينشتاين مصر (7) || شرح ال Grokking Algorithms - Recursion

Welcome back to "Grokking Algorithms: Data Structures & Algorithms Level 1" on Egypt's Einstein channel! In this sixth video of our series, we embark on an extraordinary journey into the captivating world of recursion - a powerful technique used in numerous algorithms and problem-solving approaches.

📺 Playlist Link:   • أينشتاين مصر || Grokking Algorithms in Arabic  

Recursion is a concept where a function calls itself to solve a smaller subproblem, gradually building up to solve the original, larger problem. In this episode, we demystify the beauty and power of recursion, making it accessible and comprehensible for learners of all levels.

We'll begin by introducing you to the basic idea of recursion, using simple examples to illustrate how it works. Understanding recursion can be a transformative experience, as it opens up new possibilities for solving complex problems with elegant and concise code.

Throughout the video, we'll explore the concept of base cases and why they are crucial in preventing infinite loops when using recursion. We'll also discuss the call stack and how it manages the sequence of function calls during recursive execution.

As we progress, we'll examine various classic problems that can be elegantly solved using recursion, such as calculating factorials, Fibonacci numbers, and traversing binary trees.

Moreover, we'll compare recursion with iterative approaches, highlighting scenarios where recursion shines and those where it might be less practical.

By the end of this episode, you'll have a solid grasp of recursion and its significance in algorithm design. You'll be better equipped to recognize opportunities for applying recursion to solve challenging problems efficiently and concisely.

Join us in this enlightening exploration of recursion, a tool that will expand your problem-solving capabilities. If you find this content valuable, please give it a thumbs up, and don't forget to subscribe to our channel for more captivating episodes. Let's continue our journey through data structures and algorithms together! 🚀
----------------------------------------------------------------------------------------------
محتوي الفيديو:-
00:00​ - مقدمة قناة أينشتاين مصر
00:07 - Recursion Definition & Meaning
01:50 - What is Recursion in CS?
03:00 - Recursive definition of factorial function n!
18:55 - Important Notes about Recursion
21:35 - Recursion at Grokking Algorithms Book
30:30 - Base case and recursive case
37:15 - The End
----------------------------------------------------------------------------------------------
#أينشتاين_مصر #Recursion #algorithm
╔═.♥. ════════════════════════════════════╗

ＳＵＢＳＣＲＩＢＥ | ＬＩＫＥ | ＣＯＭＭＥＮＴ | ＳＨＡＲＥ |

► Subscribe إشترك ✔

   / @einshtenmisr  

لاتنسوا الاشتـــــــراك في القنــــاة ✔ ولايـك للفيديو ✔

مشاهدة طيبة أعزائي الكرام

╚══════.♥. ═════════════════════════
#أينشتاين_مصر
#Mahmoud_Alyosify
https://MahmoudAlyosifySite.github.io/
  / einshtenmisr  
  / mahmoudalyosify  
Gmail:[email protected]
Yahoo :[email protected]