وب سایت تخصصی شرکت فرین
دسته بندی دوره ها

Programming Foundations: Algorithms

سرفصل های دوره

Algorithms are the universal building blocks of programming. They power the software you use every day, whether it's a spreadsheet, a social network, or a driving assistant. Algorithms offer a way to think about programming challenges in plain English, before they are translated into a specific language like C# or JavaScript. In this course, author and developer Joe Marini explains some of the most popular and useful algorithms for searching and sorting information, working with techniques like recursion, and understanding common data structures. He also discusses the performance implications of different algorithms and how to evaluate the performance of a given algorithm. Each algorithm is shown in practice in Python, but the lessons can be applied to any programming language. The course is also set up with GitHub Codespaces, so you can follow along with the examples without installing anything on your computer.


01 - Introduction
  • 01 - Algorithms power the world
  • 02 - What you should know

  • 02 - 1. Overview
  • 01 - What are algorithms
  • 02 - Common algorithms in programming
  • 03 - Measuring algorithm performance

  • 03 - 2. Common Data Structures
  • 01 - Introduction to common data structures
  • 02 - Arrays
  • 03 - Linked lists
  • 04 - Linked lists example
  • 05 - Stacks and queues
  • 06 - Stacks and queues example
  • 07 - Dictionaries

  • 04 - 3. Recursion
  • 01 - Understanding recursion
  • 02 - Simple recursion example
  • 03 - Calculating power and factorial

  • 05 - 4. Sorting Information
  • 01 - Overview of sorting
  • 02 - The bubble sort
  • 03 - The merge sort
  • 04 - Implementing the merge sort
  • 05 - The quicksort
  • 06 - Implementing the quicksort

  • 06 - 5. Searching for Data
  • 01 - Unordered list search
  • 02 - Binary search
  • 03 - Determine if a list is sorted

  • 07 - 6. Practical Examples with Data Structures
  • 01 - Unique filtering with sets
  • 02 - Value counting with a dictionary
  • 03 - Find max value recursively
  • 04 - Balancing statements with Stack

  • 08 - Conclusion
  • 01 - Next steps
  • 139,000 تومان
    بیش از یک محصول به صورت دانلودی میخواهید؟ محصول را به سبد خرید اضافه کنید.
    خرید دانلودی فوری

    در این روش نیاز به افزودن محصول به سبد خرید و تکمیل اطلاعات نیست و شما پس از وارد کردن ایمیل خود و طی کردن مراحل پرداخت لینک های دریافت محصولات را در ایمیل خود دریافت خواهید کرد.

    ایمیل شما:
    تولید کننده:
    مدرس:
    شناسه: 34503
    حجم: 201 مگابایت
    مدت زمان: 104 دقیقه
    تاریخ انتشار: 11 اردیبهشت 1403
    طراحی سایت و خدمات سئو

    139,000 تومان
    افزودن به سبد خرید