This repository contains implementations of key data structures in C#. Each structure is implemented efficiently for educational and practical use.
Arrays are collections of elements of the same type stored in contiguous memory locations. They allow for fast access to elements via indices.
Linked lists are collections of elements called nodes, where each node contains a value and a reference to the next node in the sequence. They allow for efficient insertion and removal of elements.
Stacks are collections of elements that follow the LIFO (Last In, First Out) principle, where the last element added is the first to be removed. They are used for memory management, undo/redo operations, and more.
For more detailed information on these implementations and their applications, read the full article on my portfolio:
Made with ❤️ by João Augusto