Перейти к содержимому

4- algorithm analysis:- Calculate t(n) using summation equation شرح عربي

Ahmed Elrefa3y

0:00 / 0:00

4- algorithm analysis:- Calculate t(n) using summation equation شرح عربي

73 902 просмотра · 6 лет назад
Ahmed Elrefa3y
12,1 тыс. подписчиков
73 902 просмотра · 6 лет назад
How to use summation equation to calculate t(n) الكورس كامل من هنا https://www.udemy.com/course/algorith... شامل هذه النقاط 1- Introduction: including all basic concepts you must know. 2- Learn How to calculate time for any algorithm (Time complexity) and what is T(n), different techniques including summation rules and how to convert loops to summation which are helpful in calculating T(n). 3- Understand Asymptotic notations (Oh, Omega, Theta, Little Oh, Little Omega) with their mathematical definition [Worst Case, Best Case, Average Case]. 4- Growth Rate VS Time and how to sort based on each one + all possible equations you may get. 5- What is recursion and how to find the Recursion equation. 6- Solve recurrence using Master theorem. 7- Solve recurrence using Tree method 8- Solve recurrence using Substitution method [Guess and verify VS Plug and chug] and much more. 9- Space Complexity. 10- exam file (mcq questions with answers) والعديد من الأمثلة والأسئلة المحلولة بشرح تفصيلي في الفيديوهات على كل الموضوعات السابقة