In the previous chapter, we saw how the intersection problem can be improved by using a sorting algorithm. This is common with many problems. If the data is organized in an ordered manner, a more efficient algorithm can be developed. In this chapter, we will start by exploring three types of sorting techniques, which are bubble, quick, and merge sorting. Later, we will learn different ways to organize data using fundamental data structures.

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

• Describe how bubble sorting works
• Implement faster sorting with quick sort
• Characterize merge sorting
• Build a linked list data structure
• Implement queues
• Describe the stack data structure