# seir-129/intro-to-sorting

cca8c15 Jan 14, 2020
1 contributor

### Users who have contributed to this file

42 lines (28 sloc) 2.15 KB

# Intro to Sorting Algorithms

## Overview

This lesson is an introduction to the concept of sorting in computer science, including sorting methods, stability, and how Big O comes into play for sorting.

## Learning Objectives

By the end of this lesson, you will be able to:

• Define the two sorting methods and when you’d use each.
• Identify whether a sort is stable or unstable, and what impact that can have.
• Explain how Big O complexity applies to sorting algorithms.

## Prerequisites

• Big O Notation

## Activity

There are a few components to this lesson, in the following order:

• To do this in class exercise, you can either...
1. Fork and clone this repository to your local machine and work in the `bubblesort.js` file
2. Use this codepen provided by the myGA Basic Sorting Algorithms module
• Note this includes insertion sort as well, but unless you finish bubble sort, don't worry about doing that section today!