Common Sorting Algorithms’ Visualizations

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

7
RSVP'd

RSVP Now

Key Themes

Web

About this event

Info

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:

  1. Algorithms and Data Structures overview
  2. Common Sorting Algorithms
  3. 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.

Requirements:

  • Basic JavaScript knowledge

  • Some programming concepts are nice to have (recursion, array manipulations)

When

When

Friday, March 19, 2021
10:00 PM – 11:30 PM UTC

Agenda

Intros
Sorting Algorithms Overview
Bubble Sort Theory
Bubble Sort Demo
Merge Sort Theory
Merge Sort Demo
Q & A

Speakers

  • Oleksandr Levinskyi

    GDG Waterloo

    Community Leader

  • Andrii Denysenko

    Vehikl

    Software Developer

Organizers

  • Maísa Wolff Resplande

    GDSC Lead

  • Gavin Abeele

    Vice Lead

  • Oleksandr Levinskyi

    Mentor

  • Emil Harvey

    Executive Lead

  • Cyril Kamal

    Executive Lead

  • Sanjay Sekar Samuel

    Executive Lead

  • Oscar Pinzon

    Executive Lead

  • Jun Cai

    Executive Lead

  • Ryan Dooley

    Executive Lead

  • Anish Reddy

    Executive Lead

  • Owen Garland

    Executive Lead

  • Michelle Gordon

    Executive Lead

  • Aniedi Udo-Obong

    Regional Leader

Contact Us