Index
A
- Adjunct / Implementation
- application
- launching / Launching and debugging
- application programming interfaces (APIs) / Dynamic
- array list
- about / Array list
- reference / Array list
- array of arrays / Jagged arrays
- arrays
- about / Arrays, Arrays
- reference / Arrays
- single-dimensional arrays / Single-dimensional arrays
- multi-dimensional arrays / Multi-dimensional arrays
- jagged arrays / Jagged arrays
- AVL trees
- about / AVL trees
- reference / AVL trees
- implementation / Implementation
- example / Example – keep the tree balanced
B
- balanced tree / AVL trees
- bidirectional edges / Concept of graphs
- Big O notation / Selection sort
- binary heaps
- about / Binary heaps
- reference / Binary heaps
- implementing / Implementation
- heap sort example / Example – heap sort
- binary search tree (BST)
- about / Binary search trees
- reference / Binary search trees, Removal
- implementation / Implementation
- node / Node
- BinarySearchTree class / Tree
- lookup / Lookup
- insertion / Insertion
- removal / Removal
- visualization / Example – BST visualization
- binary trees
- about / Binary trees
- reference / Binary trees
- implementation / Implementation
- node / Node
- BinaryTree class / Tree
- example / Example – simple quiz
- binomial heap
- about / Binomial heaps
- reference / Binomial heaps
- breadth-first search (BFS)
- about / Traversal, Breadth-first search
- reference / Breadth-first search
- breakpoint / Launching and debugging
- bubble sort
- about / Bubble sort
- references / Bubble sort
C
- circular-linked lists
- about / Circular-linked lists
- implementation / Implementation
- example / Example – spin the wheel
- classes / Classes
- coloring
- about / Coloring
- voivodeship map example / Example – voivodeship map
- composite format string
- reference / Strings
- computational complexity / Selection sort
- constant / Structs, Selection sort
D
- data structures
- classification / Classification of data structures
- data types
- about / Data types
- reference types / Reference types
- debugging / Launching and debugging
- depth-first search (DFS)
- about / Traversal, Depth-first search
- reference / Depth-first search
- dictionaries
- about / Dictionaries, Dictionaries
- references / Dictionaries
- product location / Example – product location
- user details / Example – user details
- Dijkstra's algorithm
- about / Shortest path
- reference / Shortest path
- directed edges / Concept of graphs, Example – directed and weighted edges
- directed graph / Concept of graphs
- dynamic / Dynamic
E
- edges / Edge
- enumerations / Value types, Enumerations
- expression body definition / Classes
- Extensible Markup Language (XML) / Creating the project, Example – yearly transport plan
- extension methods / Example – game map
F
- Fibonacci heap
- about / Fibonacci heaps
- reference / Fibonacci heaps
- First-In First-Out (FIFO) / Queues
- floating-point values / Structs
- four-color theorem
- reference / Coloring
G
- generic list
- about / Generic list
- reference / Generic list
- Graph class
- using / Graph
- graphs
- about / Concept of graphs, Graphs
- nodes / Concept of graphs
- edges / Concept of graphs
- self-loops / Concept of graphs
- applications / Applications
- representation / Representation
- adjacency list / Adjacency list
- adjacency matrix / Adjacency matrix
- implementing / Implementation
- nodes, using / Node
- graph traversal
- about / Traversal
- depth-first search (DFS) / Depth-first search
- breadth-first search (BFS) / Breadth-first search
H
- hash collision / Hash tables
- hash map / Hash tables
- hash sets
- about / Hash sets
- reference / Hash sets
- coupons example / Example – coupons
- swimming pools example / Example – swimming pools
- hash table
- about / Hash tables
- phone book example / Example – phone book
- heaps / Heaps
- Hoare partition scheme / Quicksort
I
- immutable value / Structs
- input data
- reading from / Reading from input
- insertion sort
- about / Insertion sort
- references / Insertion sort
- integer values / Structs
- Integrated Development Environment (IDE)
- installation / Installation and configuration of the IDE
- configuration / Installation and configuration of the IDE
- about / Installation and configuration of the IDE
- interfaces / Interfaces
- interpolated expressions / Strings
- interpolated string / Strings
J
- jagged arrays
- about / Jagged arrays
- reference / Jagged arrays
- example / Example – yearly transport plan
K
- key-value pairs / Sorted lists
- Kruskal's algorithm
- about / Kruskal's algorithm
- reference / Kruskal's algorithm
L
- Language Integrated Query (LINQ) / Programming language
- Last-In First-Out (LIFO) / Stacks
- linearithmic / Selection sort
- linked lists
- about / Linked lists
- reference / Linked lists
- book reader example / Example – book reader
- lists / Lists
- logical value / Structs
M
- mapping keys / Hash tables
- Microsoft Visual Studio 2017 Community / Installation and configuration of the IDE
- minimum spanning tree (MST)
- about / Minimum spanning tree
- Kruskal's algorithm / Kruskal's algorithm
- Prim's algorithm / Prim's algorithm
- telecommunication cable example / Example – telecommunication cable
- multi-dimensional arrays
- about / Multi-dimensional arrays
- reference / Multi-dimensional arrays
- example / Example – multiplication table, Example – game map
N
O
- object / Object
- OptimizedPriorityQueue package
- reference / Shortest path
- output data
- writing to / Writing to output
P
- pivot / Quicksort
- pointer types / Data types
- Prim's algorithm
- about / Prim's algorithm
- reference / Prim's algorithm
- priority queue
- about / Priority queues
- call center, with priority support / Example – call center with priority support
- programming language / Programming language
- project
- creating / Creating the project
Q
- quadratic / Selection sort
- query syntax / Example – list of people
- Queue class
- reference / Queues
- queues
- about / Queues, Queues
- call center, with single consultant / Example – call center with a single consultant
- call center, with many consultants / Example – call center with many consultants
- quicksort
R
- recoloring / Red-black trees
- recursion / Quicksort
- Red-Black Tree (RBT)
- about / Red-black trees
- reference / Red-black trees
- implementation / Implementation
- example / Example – RBT-related features
- reference types
- about / Data types, Reference types
- reference / Reference types
- strings / Strings
- object / Object
- dynamic / Dynamic
- classes / Classes
- interfaces / Interfaces
- delegates / Delegates
- rotations / AVL trees, Red-black trees
S
- selection sort
- about / Selection sort
- references / Selection sort
- self-balancing trees / AVL trees
- sets / Sets
- shortest path
- about / Shortest path
- game map example / Example – game map
- simple lists
- about / Simple lists
- array list / Array list
- generic list / Generic list
- example / Example – average value, Example – list of people
- single-dimensional arrays
- about / Single-dimensional arrays
- reference / Single-dimensional arrays
- example / Example – month names
- sorted dictionary
- about / Sorted dictionaries
- reference / Sorted dictionaries
- definitions / Example – definitions
- sorted lists
- about / Sorted lists
- reference / Sorted lists
- address book example / Example – address book
- sorted sets
- about / "Sorted" sets
- reference / "Sorted" sets
- duplicates, removing / Example – removing duplicates
- sorting algorithms
- about / Sorting algorithms
- selection sort / Selection sort
- insertion sort / Insertion sort
- bubble sort / Bubble sort
- quicksort / Quicksort
- spanning tree / Minimum spanning tree
- stack
- about / Stacks, Stacks
- reference / Stacks
- words, reversing / Example – reversing words
- Tower of Hanoi example / Example – Tower of Hanoi
- standard input stream / Reading from input
- standard output stream / Writing to output
- strings / Strings
- structs / Value types, Structs
- Structured Query Language (SQL) / Example – yearly transport plan
T
- time complexity / Selection sort
- Tree class / Tree
- trees
- about / Basic trees, Trees
- implementation / Implementation
- node / Node
- identifiers hierarchy / Example – hierarchy of identifiers
- company structure example / Example – company structure
U
- unbalanced tree / AVL trees
- undirected edges / Concept of graphs, Example – undirected and unweighted edges
- undirected graph / Concept of graphs
- unidirectional edges / Concept of graphs
- unweighted edges / Example – undirected and unweighted edges
- unweighted graph / Concept of graphs
V
- value types
- about / Data types, Value types
- structs / Structs
- enumerations / Enumerations
- version control system / Creating the project
W
- weighted edge / Concept of graphs, Example – directed and weighted edges
- weighted graph / Concept of graphs