DSA---学习---introduction

Introduction
1.1 Algorithms as opposed to programs
算法是程序相对面。programs usually need to contain more details than algorithms.

1.2 Fundamental questions about algorithms
1.What is it supposed to do?–specification
2.Does it really do what it is supposed to do?–verification
3.How efficiently does it do it? —performance analysis

1.3 Data structure, abstract data types, design pattern
The term data structure is used to denote a particular way of organizing data for particular types of operation.

We can do this by formulating abstract mathematical models
of particular classes of data structures or data types which have common features. These are
called abstract data types, and are defined only by the operations that may be performed on
them.

At an even higher level of abstraction are design patterns which describe the design of
algorithms, rather the design of data structures