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.
Sorting Algorithms are Your Friends.
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.
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.
After this introduction, you will be able to answer: Why are sorting algorithms important? How will I learn throughout the duration of this course? Which algorithms will I be able to implement?
After this lesson, you will be able to comprehend and explain the way bubble sort correctly sorts a data set.
After this lesson, you will know how to implement bubble sort in code, especially in the Java programming language.
After this lesson, you will be able to not only understand but also visualize how insertion sort works in practice.
After this lesson, you will be able to apply insertion sort to coding applications, especially with Java.
After this lesson, you will understand why merge sort is more complicated than bubble sort or insertion sort. You will be able to explain how merge sort is able to divide and reconstruct the data set to form a sorted set.
After this lesson, you will be able to apply recursion to construct a divide-and-conquer approach to Java sorting - in this case, with merge sort.
After this lesson, you will know when it is appropriate to use bubble sort and insertion sort instead of merge sort, in terms of run-time.
OpenCourser helps millions of learners each year. People visit us to learn workspace skills, ace their exams, and nurture their curiosity.
Our extensive catalog contains over 50,000 courses and twice as many books. Browse by search, by topic, or even by career interests. We'll match you to the right resources quickly.
Find this site helpful? Tell a friend about us.
We're supported by our community of learners. When you purchase or subscribe to courses and programs or purchase books, we may earn a commission from our partners.
Your purchases help us maintain our catalog and keep our servers humming without ads.
Thank you for supporting OpenCourser.