This event is going to be a general overview of common sorting algorithms. We will go over different ways you can do sorting and their complexities. There is going to be a live demo of Bubble and Merge sorts.
Mar 19, 2021, 10:00 – 11:30 PM
About this event
Any successful programmer, sooner or later, needs to learn algorithms and data structures. Many interviews at tech companies like Google require you to have knowledge of these concepts. Do not hesitate to join this event to step on the way to becoming tech savvy!
This event series consists of 3 parts:
Algorithms and Data Structures overview
Common Sorting Algorithms
Graph Traversal and Pathfinding
This series is dedicated to making you familiar with basic algorithms and data structures. During the second event, we will learn what types of sorting algorithms exist, and how some of them work. Particularly, we will do a live coding session of Bubble and Merge sorts.
Some programming concepts are nice to have (recursion, array manipulations)
Friday, March 19, 2021 10:00 PM – 11:30 PM UTC
Go over the structure of the event series.
Sorting Algorithms Overview
We will learn what sorting algorithms exist, what their differences are and why you would use one over the other.
Bubble Sort Theory
This section will cover the most basic sorting algorithm: Bubble Sort. We will understand how it works and go over a simple visualization.
Bubble Sort Demo
Merge Sort Theory
Here, we will cover the merge sort. We will understand how it works and go over a simple visualization.
Merge Sort Demo
Q & A
It’s time for all of your questions you had during the session!