Join Raghavendra Dixit for an in-depth discussion in this video Introduction, part of Introduction to Data Structures & Algorithms in Java.
- [Instructor] You've already seen some sorting algorithms. The basic sorting algorithms take order of n squared time in the worst case to sort data of size n. Merge sort improves upon these algorithms and takes order of n log n time in the worst case. For any general unordered set of data n log n algorithms are the best known ones for sorting. But because the constant factors in merge sort are a little high it doesn't work very well for smaller sets of data.
Now in this chapter, we will learn some more sorting algorithms, which take very interesting approaches to sort data. The first one is the quick sort algorithm which is based on recursion techniques. Then we will learn the shell sort algorithm which is basically an improved version of insertion sort. Then we will also learn about some linear time algorithms like counting, radix, and bucket sort. But these algorithms work for some specific kinds of data and they're not effective for any general data area.
Now for this chapter, I will attach the source code at the right places, but you will not implement these algorithms during the lectures. The idea is to explain these using animations so that you get a feel of these algorithms. So let's start with the quick sort algorithm.
Note: This course was created by Packt Publishing. We are pleased to host this training in our library.
- Why study data structures and algorithms?
- How to calculate the time complexity
- Using Big O notation
- Using basic sorting and search algorithms
- Searching elements in unordered arrays and ordered arrays
- Implementing a linked list in Java
- Implementing stacks using arrays
- Queues using arrays
- Binary search trees
- Representing heaps using arrays
Skill Level Intermediate
1. Introduction to Algorithms
2. Analysis of Algorithms
3. Basic Sorting and Search Algorithms
4. Linked Lists
5. Stacks and Queues
7. Binary Search Trees
8. More Sorting Algorithms
- Mark as unwatched
- Mark all as unwatched
Are you sure you want to mark all the videos in this course as unwatched?
This will not affect your course history, your reports, or your certificates of completion for this course.Cancel
Take notes with your new membership!
Type in the entry box, then click Enter to save your note.
1:30Press on any video thumbnail to jump immediately to the timecode shown.
Notes are saved with you account but can also be exported as plain text, MS Word, PDF, Google Doc, or Evernote.