Udemy
Turn what you know into an opportunity and reach millions around the world.
Learn More
Your cart is empty.
Keep shopping
Most fundamental Array Algorithms
Rating: 4.0 out of 5(1 rating)
483 students

Most fundamental Array Algorithms

Hands-on implementation of search and sorting algorithm
Created bySuman Datta
Last updated 10/2022
English
English [Auto],

What you'll learn

  • Develop Algorithmic thinking
  • Learn about structure of a Computer Program using Python
  • Learn about how to Test a Computer Program
  • Learn 2 fundamental Array Algorithms

Coding Exercises

This course includes our updated coding exercises so you can practice your skills as you learn.

See a demo
Image of coding exercise example

Course content

2 sections • 6 lectures • 44m total length

  • Introduction1:37

    Overview of the class

  • Array - a simple introduction8:25

    Learn how arrays store multiple numbers, index from zero, and traverse with for loops in Python, then implement in-place running sums and array reversal using two pointers.

  • Array Partition Algorithm9:32

    Learn array partitioning with a pivot, placing it at its final position so left of pivot are ≤ pivot and right are ≥ pivot, using a two-pointer swap.

  • Array Partition Python Program5:21

    Demonstrate array partitioning in Python using a partition function with two pointers and a first-element pivot to separate values into left and right partitions, ending with a final swap.

  • Binary Search Algorithm12:25

    Explore binary search on a sorted array to locate x using two pointers and a left-biased midpoint, halving the search space and returning the index or -1 if not found.

  • Binary Search Python Program7:05

    Learn binary search in Python on a sorted array, using mid and start/end pointers to locate a target or return -1, with examples like x=7 at index 4.

Requirements

  • You need to install 2 softwares Pycharm and Anaconda to have a Python programming environment ready.

Description

All aspiring programmers - this class will introduce you to the inner working of some of the most basic algorithms. Developing an algorithm from scratch reveals a whole lot of internal details that are otherwise not obvious. Programming is a lot about being able to handle these details. This class deals with simple and well-known algorithms that work on an array of numbers. The aim is to clearly visualize what goes on under the hood for these most basic algorithms. Knowing these details is a must to become a confident programmer.

In order to start with this course, you need to have a Python programming environment ready. I suggest Anaconda with Pycharm. You may also do with Jupyter notebook. First it introduces a very basic data structure called Array. Then you will learn 2 most used algorithms namely Partitioning and Binary Search. You will be able to know exact steps of these algorithms and visualize the inner working. The implementation of these algorithms is given and you are encouraged to test them in your own Python programming environment.

At the end, you are invited to implement another very well-known algorithm called QuickSort. This is your project after completing the lectures. Good luck!

Who this course is for:

  • New to advanced level programmers interested in internal details of some fundamental algorithms

Report abuse