ByteTrail

Level 2 · Module 14

Algorithms

A structured module covering the essential ideas of algorithms.

Difficulty
beginner
Published path
13 lessons · 130 min

What you will learn

  • Linear search
  • Binary search
  • Sorting
  • Bubble sort
  • Selection sort
  • Insertion sort
  • Merge sort
  • Quick sort
  • Recursion
  • Divide and conquer
  • Greedy algorithms
  • Backtracking
  • Dynamic programming
Prerequisites:Discrete Mathematics

Start here

Lessons · 130 min

  1. Linear searchPlanned

    Planned lesson: Linear search. This lesson has not been written yet.

    10 min · beginner

  2. Binary searchPlanned

    Planned lesson: Binary search. This lesson has not been written yet.

    10 min · beginner

  3. SortingPlanned

    Planned lesson: Sorting. This lesson has not been written yet.

    10 min · beginner

  4. Bubble sortPlanned

    Planned lesson: Bubble sort. This lesson has not been written yet.

    10 min · beginner

  5. Selection sortPlanned

    Planned lesson: Selection sort. This lesson has not been written yet.

    10 min · beginner

  6. Insertion sortPlanned

    Planned lesson: Insertion sort. This lesson has not been written yet.

    10 min · beginner

  7. Merge sortPlanned

    Planned lesson: Merge sort. This lesson has not been written yet.

    10 min · beginner

  8. Quick sortPlanned

    Planned lesson: Quick sort. This lesson has not been written yet.

    10 min · beginner

  9. RecursionPlanned

    Planned lesson: Recursion. This lesson has not been written yet.

    10 min · beginner

  10. Divide and conquerPlanned

    Planned lesson: Divide and conquer. This lesson has not been written yet.

    10 min · beginner

  11. Greedy algorithmsPlanned

    Planned lesson: Greedy algorithms. This lesson has not been written yet.

    10 min · beginner

  12. BacktrackingPlanned

    Planned lesson: Backtracking. This lesson has not been written yet.

    10 min · beginner

  13. Dynamic programmingPlanned

    Planned lesson: Dynamic programming. This lesson has not been written yet.

    10 min · beginner

What you will cover

Module units

  1. Linear search

    A planned unit covering Linear search.

  2. Binary search

    A planned unit covering Binary search.

  3. Sorting

    A planned unit covering Sorting.

  4. Bubble sort

    A planned unit covering Bubble sort.

  5. Selection sort

    A planned unit covering Selection sort.

  6. Insertion sort

    A planned unit covering Insertion sort.

  7. Merge sort

    A planned unit covering Merge sort.

  8. Quick sort

    A planned unit covering Quick sort.

  9. Recursion

    A planned unit covering Recursion.

  10. Divide and conquer

    A planned unit covering Divide and conquer.

  11. Greedy algorithms

    A planned unit covering Greedy algorithms.

  12. Backtracking

    A planned unit covering Backtracking.

  13. Dynamic programming

    A planned unit covering Dynamic programming.