The Way To My Dream

【1.Basic Algorithm Analysis】 Big-O Notation: roughly estimates how the algo scales when it's used on diff sized datasets. eg: O(function);   The func is a math formula based on n and c: n represent

1.Linked List   Each node in a linked list points to the next node in the list. 2.Singly Linked Lists   Each node in the list points only to the next node. 3.The SListNode Class   two data member

1.Linked Stacks   A linked stack uses a linked list to store the data in the stack. template class LStack : public DLinkedList { public: };   The head of the list points to the bottom of t

1.It is a long one-dimensional structure containing numerous cells.Each cell can contain one item, and an index number is used to access each cell.(the first cell has an index of 0).   Accessing item

1.Multi-Dimension   x axis: length; y axis: height; z axis: depth 2.Native Multi-Dimensional Arrays int array2d[height][width]; int array3d[depth][height][width]; address(array[z][y][x]): (z * wi

1.A Bitvector is a specialized kind.Is meant to condense bit values(or booleans) into an array so that no space is wasted. 2.A Bitvector Class [The Data] typedef unsigned long int INT32; class Bit

1.Sparse Data // 稀疏数据 e.g:   Imagine each player in the game is accessed by an id number.This number is often called a key in programming.Each key will be unique.They are instead generated by a comp