Build X: Algorithms

Intro

In this repository you will find resources for KCL Tech's "Build X: Algorithms" workshop. Here you will find links to lecture notes and code examples.

Week 1 - Topics

1. What is complexity/efficiency - "Big O" notation

2. Time Complexity

3. Memory Consumption

4. How can we calculate them.

5. Basic Sorting Algorithms

6. Bubble Sort

7. Couting Sort

8. Insertion Sort

9. Selection Sort

Week 2 - Topics

1. Functions 2 . Recursion
2. Merging 2 sorted lists
3. Divide and Conquer Technique
4. Binary Search
5. Merge Sort
6. Quick Sort
7. Radix Sort

###Week 3 - Topics

1. Week 2 - Winner && Challenges
2. Lee's Expansion Algorithm
3. Mouse Labyrinth
4. Minesweeper Game
5. Subarray of Maximum Sum

###Week 4 - Topics

Algorithms in Security by Luca Vigano

###Week 5 - Topics

Graph Builds by Martin Chapman

###Week 6 - Topics

1. Week 5 - Winner && Challenges
2. Prim’s Algorithm
3. Kruskal's Algorithm
4. Warshall's Algorithm
5. Roy-Floyd's Algorihtm
6. Short Intro to Heap Data Structure
7. Prim’s Algorithm using Heap