This is the 10th day of my participation in Gwen Challenge

The introduction

Basic concepts of data structures

  • Data: The carrier of information
  • Data element: The basic unit of data. A data element consists of several data items

Eg. A student record is a data element, including name, student id and other data items

  • Data object: A collection of data elements of the same nature

Eg. Integer data objects are sets N={0,+1,-1}

A sense is a legitimate field of data elements

  • Data type: The collective name for a set of values and a set of operations defined on that set

    • Atomic type: A data type whose value is no longer divided
    • Structure type: a data type whose value can be further decomposed into several components
    • Abstract data types: Abstract data organizations and operations associated with them

  • Abstract Data type (ADT) : REFERS to a mathematical model and the set of operations defined on the model. The definition of an abstract data type depends only on its set of logical properties, and nothing else. Abstract data types are usually represented by triples (data objects, data relationships, basic sets of operations).

  • Data structures: The relationships between data elements and each other are called structures. Data structure includes three aspects: logical structure, storage structure and data elements.

    • Logical structure: Algorithm design
      • Set (usually not used)
      • Linear structure
      • A tree structure
      • Graph structure or network structure
    • Storage structure: Implementation of the algorithm
      • Sequential storage
      • Chain store
      • Index storage (additional index tables are created while information is stored)
      • Network storage

Algorithms and algorithm evaluation

algorithm

  • Finite deterministic feasible input and output

Good algorithm

  • Correctness readability robustness efficiency and low storage requirements

Time complexity

  • Addition rule
  • The multiplication rule

Spatial complexity