Computer algorithms and data structures

Computer algorithms and data structures are a basic subject currently belonging to the basic education of every IT engineer, electronics engineer or telecommunications engineer.
The "Computer algorithms and data structures" handbook is a short, standard, typical for all faculties of informatics at the technical university lecture on computer algorithms. After a brief introduction to issues related to the design of algorithms are discussed in turn: computational complexity, sorting algorithms, pattern search algorithms, graph algorithms and dictionaries. The book is intended for students of the Faculty of Electronics and Information Technology of the Warsaw University of Technology and is adapted to the current program.

Table of Contents

Preface
List of markings
1. INTRODUCTION
1.1. Algorithm, analysis and design of algorithms
1.2. Computational complexity of the algorithm - basic concepts
1.3. Ways of describing algorithms
1.4. Asymptotic entries
1.5. Elementary data structures
1.6. Recursion and algorithm design methods
1.7. Recursive equations
1.8. Probabilistic algorithms
2. CLASSES FOR COMPLEXITY OF ALGORITHMS AND NP-COMPLETE
2.1. Theory of computational complexity
2.2. Calculation problems
2.3. Decision problems
2.4. Classes of complexity
2.5. Classes of complexity of probabilistic algorithms
3. SORTING ALGORITHMS
3.1. Sorting problem
3.2. Bubble sorting (bubblesort)
3.3. Modified bubbleort (modified bubbleort)
3.4. Sorting by insertion (insertionsort)
3.5. Sorting by selection (selectionsort)
3.6. Sorting by merging (mergesort)
3.7. Sorting by hams (heapsort)
3.8. Quick sorting (quicksort)
3.9. Fast algorithms for determining the k-th element as to the value in the sequence
3.10. Linear sorting algorithms (countsort, radixsort, bucketsort)
3.11. External sorting
3.12. Sorting networks
4. SEARCH ALGORITHMS
4.1. The pattern search problem
4.2. Naive algorithm for pattern search
4.3. The Rabbin-Karp algorithm
4.4. A pattern search algorithm using a finite state machine
4.5. Knuth-Morris-Pratt algorithm
5. GRAPHIC ALGORITHMS
5.1. Introduction
5.2. Searching the graph in breadth
5.3. Graph searching in depth
5.4. Weighted graphs directed. The problem of the shortest path with one source
6. DICTIONARIES AND OPERATIONS ON DICTIONARIES
6.1. Introduction
6.2. Dictionary algorithms with linear complexity
6.3. Algorithms using a linearly ordered dictionary implemented in arrays
6.4. Dictionary implemented in the binary search tree
6.5. A linearly arranged dictionary implemented in key-indexed tables
6.6. A linearly arranged dictionary implemented in hash tables
Literature