In this chapter we discussed several of the more common sorting algorithms you might encounter in your day-to-day experience. We started with several comparison sorts including selection, insertion, and bubble. We noted that a selection sort is perhaps the most inefficient sorting algorithm you are likely to encounter in the real world, but that's not to say that it is completely academic. Insertion sort somewhat improves on selection, as does the bubble sorting algorithm. Next, we examined two divide and conquer sorting algorithms including quick sort and merge sort. Both of these approaches are much more efficient than comparison sorts. Finally, we explored a common and highly efficient distribution sort called the counting sort. The counting sort is the most efficient algorithm we examined, but it is not necessarily the best fit for every situation.

#### Everyday data structures

##### By :

#### Everyday data structures

##### By:

#### Overview of this book

Explore a new world of data structures and their applications easily with this data structures book. Written by software expert William Smith, you?ll learn how to master basic and advanced data structure concepts. ? Fully understand data structures using Java, C and other common languages ? Work through practical examples and learn real-world applications ? Get to grips with data structure problem solving using case studies

Table of Contents (20 chapters)

Everyday Data Structures

Credits

About the Author

About the Reviewer

www.PacktPub.com

Customer Feedback

Preface

Free Chapter

Data Types: Foundational Structures

Arrays: Foundational Collections

Lists: Linear Collections

Stacks: LIFO Collections

Queues: FIFO Collections

Dictionaries: Keyed Collections

Sets: No Duplicates

Structs: Complex Types

Trees: Non-Linear Structures

Heaps: Ordered Trees

Graphs: Values with Relationships

Sorting: Bringing Order Out Of Chaos

Searching: Finding What You Need

Customer Reviews