- Introduction
- Bubble Sort Overview
- Bubble Sort: The Code
- Insertion Sort Overview
- Insertion Sort: The Code
- Merge Sort Overview
- Merge Sort: The Code
- Comparing the Speed of the Sorting Algorithms
- Basic Sorting Algorithms
What you'll learn
- Implement basic sorting algorithms into their own programs
- Understand the procedure and theory behind sorting algorithms
- Determine the relative speed of basic sorting algorithms
Description
Does the word "algorithm" intimidate you? Well, it shouldn't! Algorithms are incredibly powerful programming tools, and once you pick up the basics of sorting algorithms, you'll be on your way in no time.
Begin Your Algorithm Journey With This Course Designed Specifically for Algorithm Newbies.
- Learn the basic sorting algorithms first so you can eventually move on to more complicated algorithms
- Implement the algorithms in Java code to see how they look in practice
- Distinguish between the various features of basic sorting algorithms
Sorting Algorithms are Your Friends.
Sorting algorithms are not scary beasts; they are very practical programming tools. They can sort many different data sets: a basic integer array, a database of names, or a deck of cards. Nearly any large program could, and should, implement sorting algorithms.
That being said, algorithms are very important to software engineers. Let's say you're a video game programmer. You're going to need to be able to sort your hero's inventory or bank. Or, let's say you're a web developer. You're going to want to sort your content in a specific order.
Content and Overview
This course is designed for the average programmer who has absolutely no experience with algorithms. Although I recommend that you have some programming experience, particularly in Java, I assume no prior knowledge of algorithms.
You'll go through 8 lectures and 1 hour of content to get your feet wet in these sorting algorithms. Throughout the duration of the course, I'll focus on bubble sort, insertion sort, and merge sort - 3 beginner friendly sorting algorithms.
I take a two-pronged teaching approach. First, you'll see a definition and visual demonstration of each algorithm. This facilitates the second prong: the code. I'll take you step-by-step through the code implementation, explaining every line I type.
If you're looking to deepen your programming experience, and you're willing to learn, I recommend this course!
Students also bought
Información sobre el Instructor

- 4.55 Calificación
- 3704 Estudiantes
- 1 Cursos
Brendan Campbell
Programmer and Game Designer
Thirteen. Long. Hours. The sun had risen from the east, set in the west, and I had accomplished… nothing. My sixth grade self just wanted to display a simple image onto an iPhone screen, but my lackluster programming skills had a different agenda. I knew that programming shouldn’t be this hard, if only the available resources lessened the learning curve.
I felt like any book I read or tutorial I watched assumed some sort of "prior knowledge." I was so frustrated - where does one acquire this prior knowledge?!
That is my goal as an instructor: to turn someone who has absolutely no programming experience into someone who can comfortably code on their own. Since I began programming in 6th grade, I understand what it's like to start from scratch. If I could do it, you can, too.
My main specialities are in iOS programming and Java. I've released 3 iOS applications, one of which was eventually acquired by another company. I also have university credit for Java.
Above all, I care about my students. I want to provide quality education, so I put time and effort into what I do.
I hope we'll be in touch!
Student feedback
Course Rating
Reviews
Good to know the basic
Simple and to the point
Fantastic course. I wish it also included Quick Sort, but for the 3 methods covered, it's great. The only downside is that when coding the Merge Sort is that the instructor's code is cut off so it's hard to compare your code side-by-side without backing up in the video. Otherwise it's a great beginner level tutorial!