ابدأ هنا، والباقي خطوة بخطوة.
شرح قصير، مثال تجرّبه بنفسك، ثم سؤال يثبت فهمك. اختر محاضرتك واترك الباقي علينا.
Algorithms: What They Do and How We Compare Them
Start with the required answer, then learn to compare work and read Big O without confusing it with an exact count.
- 01افهم الفكرةشرح واضح، بالقدر الذي تحتاجه.
- 02جرّب المثالتوقّع الخطوة وشاهد ما يتغيّر.
- 03حلّ سؤالًاحاول أولًا، ثم قارن خطواتك بالحل.
محاضراتك، بالترتيب
Algorithms: What They Do and How We Compare Them
Start with the required answer, then learn to compare work and read Big O without confusing it with an exact count.
افتح الشرحصفحات الدفترأسئلة السنوات 7ماذا سأتعلم؟
- Identify the input, required output, and conditions of a problem.
- Separate a correct solution from a more efficient solution.
- Explain input size, operation counts, worst case, and Big O in simple terms.
Count the Work Before Writing Big O
Trace small pieces of code, then count fixed work, loops, halving, consecutive parts, and alternative branches.
افتح الشرحصفحات الدفترأسئلة السنوات 13ماذا سأتعلم؟
- Count executions of a statement and a loop with explicit bounds.
- Trace halving and explain why braces and stopping conditions matter.
- Decide when to add work and when to choose the larger branch.
Check Termination, Then Find the Maximum
Check whether code finishes, count the parts that actually run, and build a correct algorithm for the largest array element.
افتح الشرحصفحات الدفترأسئلة السنوات 1ماذا سأتعلم؟
- Explain what code computes separately from how much work it does.
- Notice missing counter updates and incomplete stopping conditions.
- Trace a maximum search and justify its n − 1 value comparisons.
Before Sorting: What Are We Ordering?
Define the required order, look inside a comparison, and choose an algorithm that fits the data and memory limits.
افتح الشرحصفحات الدفترماذا سأتعلم؟
- State what is being sorted and whether the required order is ascending or descending.
- Separate the number of elements from the length of a string or the number of digits.
- Justify an algorithm choice using its assumptions, time, and extra memory.
Selection Sort and Insertion Sort, One Move at a Time
Trace the same two arrays, understand the role of each variable, and count comparisons, swaps, and shifts separately.
افتح الشرحصفحات الدفترأسئلة السنوات 17ماذا سأتعلم؟
- Explain how Selection Sort finds the smallest remaining element before swapping it into position.
- Explain how Insertion Sort saves a value, shifts larger elements, and fills the gap.
- Count the displayed operations and connect them to the time and space bounds.
Bubble Sort: Neighbours, Passes, and When to Stop
Trace both scan directions, understand the sorted flag, and prepare for Divide and Conquer.
افتح الشرحصفحات الدفترماذا سأتعلم؟
- Trace adjacent comparisons without confusing the two scan directions.
- Explain the stopping flag and distinguish best-case from worst-case work.
- Describe divide, conquer, and combine using a sorting problem.
Merge Sort: Small Sorted Parts Become One Sorted Array
Split the original eight values, merge them with two counters, and explain the work at each recursion level.
افتح الشرحصفحات الدفترماذا سأتعلم؟
- Trace splitting and merging while preserving every input value.
- Use a base case, two ranges and a helper array correctly.
- Justify the time, space and stability of the displayed implementation.
Quick Sort: Put a Pivot in Its Place
Follow the two original partition traces, finish the pivot swap, and see why balanced splits matter.
افتح الشرحصفحات الدفترماذا سأتعلم؟
- Partition an inclusive range around its first value with bounded scans.
- Distinguish a partitioned array from a fully sorted array.
- Explain balanced, worst-case and expected running time with their assumptions.
From Graphs to Trees to a Binary Search Tree
Separate connections, parent-child structure and key order, then build the original BST example.
افتح الشرحصفحات الدفترماذا سأتعلم؟
- Recognise graph, tree, binary tree and BST as different sets of rules.
- Read the source graph examples with explicit direction and cycle definitions.
- Build the BST for the given insertion order and state the duplicate policy.
Read a BST: Paths, Depth, Height, and Levels
Use the same nine-node tree to count edges, follow a search route, and separate depth from height.
افتح الشرحصفحات الدفترماذا سأتعلم؟
- Follow a root-to-node search route and distinguish it from a general tree path.
- Compute depth, height and level using an explicit edge-count convention.
- Explain how a tree representation supports an application and its documentation.