Skip to content

Project researching sorting methods and big o time complexity.

Notifications You must be signed in to change notification settings

acanna2013/sort_big_o

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

12 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Background

I was introduced to sorting algorithms and Big-O notation in a course offered at my high school. These are the courses I took:

graph LR
A(Intro to Programming) --> B(AP Computer Science A) --> C(AP Computer Science Principles) --> D(Advanced Topics in Programming)
Loading

What I Learned

I learned about the most popular sorting algorithms

  • Bubble Sort
  • Selection Sort
  • Insertion Sort
  • ...
    I also created my own sorting algorithm, where we adopted the idea of selection sort and sorted according to the maximum value instead of the minimum value.

This repo includes severals projects I worked on using what I learned.

About

Project researching sorting methods and big o time complexity.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages