20 Searching and Sorting

20.1 Introduction

20.2 Searching Algorithms

20.2.1 Efficiency of Linear Search

20.2.2 Binary Search

20.3 Sorting Algorithms

20.3.1 Efficiency of Selection Sort

20.3.2 Efficiency of Insertion Sort

20.3.3 Merge Sort (A Recursive Implementation)

20.4 Wrap-Up

21 Data Structures

21.1 Introduction

21.2 Self-Referential Classes

21.3 Dynamic Memory Allocation and Data Structures

21.4 Linked Lists

21.5 Stacks

21.6 Queues

21.7 Trees

21.8 Wrap-Up

22 Bits, Characters, C-Strings and structs

22.1 Introduction

22.2 Structure Definitions

22.3 Initializing Structures

22.4 Using Structures with Functions

22.5 typedef

22.6 Example: High-Performance Card Shuffling and Dealing Simulation

22.7 Bitwise Operators

22.8 Bit Fields

22.9 Character-Handling Library

22.10 Pointer-Based String-Conversion Functions

22.11 Search Functions of the Pointer-Based String-Handling Library

22.12 Memory Functions of the Pointer-Based String-Handling Library

22.13 Wrap-Up

 

Page 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9