Search icon CANCEL
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Conferences
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Python Data Structures and Algorithms

You're reading from   Python Data Structures and Algorithms Improve application performance with graphs, stacks, and queues

Arrow left icon
Product type Paperback
Published in May 2017
Publisher Packt
ISBN-13 9781786467355
Length 310 pages
Edition 1st Edition
Languages
Arrow right icon
Author (1):
Arrow left icon
Benjamin Baka Benjamin Baka
Author Profile Icon Benjamin Baka
Benjamin Baka
Arrow right icon
View More author details
Toc

Table of Contents (14) Chapters Close

Preface 1. Python Objects, Types, and Expressions 2. Python Data Types and Structures FREE CHAPTER 3. Principles of Algorithm Design 4. Lists and Pointer Structures 5. Stacks and Queues 6. Trees 7. Hashing and Symbol Tables 8. Graphs and Other Algorithms 9. Searching 10. Sorting 11. Selection Algorithms 12. Design Techniques and Strategies 13. Implementations, Applications, and Tools

Summary

In this chapter, we have explored a number of sorting algorithms. Quick sort performs much better than the other sorting algorithms. Of all the algorithms discussed, quick sort preserves the index of the list that it sorts. We'll use this property in the next chapter as we explore the selection algorithms.

lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at €18.99/month. Cancel anytime