#### Overview of this book

Building your own applications is exciting but challenging, especially when tackling complex problems tied to advanced data structures and algorithms. This endeavor demands profound knowledge of the programming language as well as data structures and algorithms – precisely what this book offers to C# developers. Starting with an introduction to algorithms, this book gradually immerses you in the world of arrays, lists, stacks, queues, dictionaries, and sets. Real-world examples, enriched with code snippets and illustrations, provide a practical understanding of these concepts. You’ll also learn how to sort arrays using various algorithms, setting a solid foundation for your programming expertise. As you progress through the book, you’ll venture into more complex data structures – trees and graphs – and discover algorithms for tasks such as determining the shortest path in a graph before advancing to see various algorithms in action, such as solving Sudoku. By the end of the book, you’ll have learned how to use the C# language to build algorithmic components that are not only easy to understand and debug but also seamlessly applicable in various applications, spanning web and mobile platforms.
Chapter 1: Data Types
Free Chapter
Chapter 2: Introduction to Algorithms
Chapter 3: Arrays and Sorting
Chapter 4: Variants of Lists
Chapter 5: Stacks and Queues
Chapter 6: Dictionaries and Sets
Chapter 7: Variants of Trees
Chapter 8: Exploring Graphs
Chapter 9: See in Action
Chapter 10: Conclusion
Index
Other Books You May Enjoy

# Sorted lists

So far, you’ve learned how to store data using simple lists. However, do you know that you can even use a data structure that ensures that the elements are sorted all the time? If not, let’s get to know the `SortedList` generic class (from the `System.Collections.Generic` namespace), which is a collection of key-value pairs, sorted by keys, without the necessity for you to sort them on your own. It’s worth mentioning that all keys must be unique and cannot be equal to `null`.

Imagine a sorted list

If you want to imagine a sorted list, think about a business holder in which you put business cards that you have received from other people. Since you like order and want to always be able to quickly find a business card for a specific person, you make sure that they are all arranged in alphabetical order, by last name. What a terrible waste of time, especially if you have dozens of business cards and suddenly you have to put in a card for Mrs. Ana Ave....