في هذا المساق، سنذهب في رحلة إلى عالم الـalgorithms (الخوارزميات)، وسنشرح ماهيتها، وكيفية تمثيلها بشكل يسهل فهمها، وسنتعلم كيف نقارنها على أساس كفاءتها. كما سنستكشف أنواعاً مختلفة من الـalgorithms التي تُستخدم لحل مختلف المشاكل، منها الـbrute force، الـgr
ماذا ستتعلم؟
- ما هي الـalgorithms (الخوارزميات).
- طريقة تمثيل الـalgorithms باستخدام الـflowcharts.
- طريقة مقارنة الـalgorithms على أساس الـcomplexity (التعقيد).
- Brute force algorithms.
- Greedy algorithms.
- The two pointers algorithm.
- The binary search algorithm.
محتوى المساق
الجلسة 1: مقدمة
Flowcharts 2: Loops
You don't currently have access to this content
الخوارزميات الجيدة والخوارزميات السيئة
You don't currently have access to this content
تحديد الجيد والسيء: big O notation
You don't currently have access to this content
الجلسة 2: Brute force
الجلسة 2: Brute force
You don't currently have access to this content
المثال الأول لـ Brute force
You don't currently have access to this content
المثال الثاني لـ Brute force
You don't currently have access to this content
المثال الثالث لـ Brute force
You don't currently have access to this content
الجلسة 3: خوارزميات Greedy
خوارزميات Greedy: مقدمة
You don't currently have access to this content
Greedy المثال الأول
You don't currently have access to this content
Greedy المثال الثاني
You don't currently have access to this content
Greedy المثال الثالث
You don't currently have access to this content
الجلسة 4: Two pointers
Two pointers: مقدمة
You don't currently have access to this content
Two pointers تكملة المثال الأول
You don't currently have access to this content
Two pointers المثال الثاني
You don't currently have access to this content
Two pointers المثال الثالث
You don't currently have access to this content
الجلسة 5: Binary search
Binary search: مقدمة
You don't currently have access to this content
مثال على Binary search
You don't currently have access to this content
تكملة مثال Binary search
You don't currently have access to this content