Getting started with algorithms using arrays

Photo by Ian Keefe on Unsplash

Arrays are a good way to dip your toe in the study of algorithms. They are not as complex as Trees or graphs and can serve a smooth bridge into more complex alogrithms. They are widely used in all sorts of  problems.

What is an array?

An array is a list or collection of elements. In dynamically typed languages like javascript and python an array could store multiple different types of elements. We could, for example, have an array that has a string, a number and a boolean.

let array = [1, 'Jon Snow', true]

In statically typed languages, the arrays can have only one type of elements. That means it could only have numbers or it could only have strings, or it could only have booleans. But this difference doesn't matter for now, we are only going to look into the arrays that have a single type of element.

We will start with Searching Algorithms.

  1. Sequential or Linear Search in an Array
  2. Binary Search in an Array
  3. How to find the smallest number in an array?

Then we will move on to Sorting Algorithms.

  1. Sorting an Array Using Selection Sort
  2. Sorting an array using Merge Sort

This crash course is for beginners and it will be good for you if you are just getting in the game. If you already know all this, write to us at [email protected] or send us a message on facebook, we have an advanced one on one course with limited seats.

Feliz Aprendizaje!!