## A* Search Algorithm

The A* Search algorithm (pronounced “A star”) is an alternative to the Dijkstra’s Shortest Path algorithm. It is used to find the shortest path between two nodes of a weighted graph. The A* Search algorithm performs better than the Dijkstra’s

## Air Flight Route Planner

For this challenge you will use a graph data structure to create an Air Fligh Route Planner for a fictitious airline company offering flights across Europe. Here is a map showing all the direct flights offered by this airline company:

## The Social Network

Six Degrees of Separation The Six degrees of separation is an idea that was originally set out by Frigyes Karinthy in 1929 and that can be applied to Social Networks such as Facebook. It is based on the idea that

## London Underground – Journey Planner

The aim of this Python challenge is to investigate how graphs can be used in Computer Science and investigate the key algorithms used when manipulating graphs in Python such as an algorithm to find the shortest path between two nodes

## Insertion Sort Algorithm

The Insertion sort algorithm is one of the key sorting algorithms used in Computer Science. To start with, the algorithm considers the first value of a list as a sorted sub-list (of one value to start with). This iterative algorithm

## Bubble Sort Algorithm

The Bubble sort algorithm is one of the key sorting algorithms used in Computer Science. It is a fairly simple algorithm to implement and is particularly useful when you need to find the top x values of a list. The

## Backtracking Maze – Path Finder

The purpose of this Python challenge is to demonstrate the use of a backtracking algorithm to find the exit path of Maze. Backtracking Algorithm A backtracking algorithm is a recursive algorithm that attempts to solve a given problem by testing

## Backtracking Algorithm – Sudoku Solver

The purpose of this Python challenge is to demonstrate the use of a backtracking algorithm to solve a Sudoku puzzle. Did You Know? The objective of a Sudoku puzzle is to fill a 9×9 grid with digits so that each

## Backtracking Algorithm – Magic Square Solver

The purpose of this Python challenge is to demonstrate the use of a backtracking algorithm to solve a Magic Square puzzle. Did You Know? A 3×3 magic square is an arrangement of the numbers from 1 to 9 in a

## What’s an algorithm and what is pseudo code?

Check this video/animation from Ted Ed to understand what we mean by algothirm and pseudo code. Source: http://ed.ted.com/lessons/your-brain-can-solve-algorithms-david-j-malan#watch