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.
Table of Contents (13 chapters)
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

Circular queues

At the end of this chapter, let’s take a look at another data structure, namely a circular queue, also called a ring buffer. In this case, a queue forms a circle, internally uses an array, and the maximum number of elements that can be placed inside the queue is limited. You need to specify two variables that indicate indices of the front and rear elements. The front one points to the element that will be dequeued first. The rear one points to the element that is the last in the queue.

Imagine a circular queue

If you want to better imagine a circular queue, think back to your young years when you persuaded your parents to take you on a roller coaster. It consisted of 10 carriages, each with room for 2 people, so only 20 people could take part in 1 roller coaster ride. As this was a unique attraction, such a ride took place only once an hour. This meant that only 20 people were allowed to enter a queue for the roller coaster and no one else. As the departure...