# ten_sorting_algorithms

**Repository Path**: qiuweiwei/ten_sorting_algorithms

## Basic Information

- **Project Name**: ten_sorting_algorithms
- **Description**: No description available
- **Primary Language**: C++
- **License**: MIT
- **Default Branch**: master
- **Homepage**: None
- **GVP Project**: No

## Statistics

- **Stars**: 0
- **Forks**: 0
- **Created**: 2019-11-18
- **Last Updated**: 2020-12-19

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## README

# Basic DataStruct
## finish process
### List
####  1.Sequence List
-   DataStruct  √
-   Function
    -   void initList(SqList &L,int initLength,int incrementStep) √
    -   int  getLength(SqList L)    √
    -   bool  isEmpty(SqList L)    √
    -   int getIndexOfElem(SqList L, ElemType e);√
    -   bool expendSqList(SqList &);√
    -   insertBeforeIndex(SqlList &,int index,ElemType e);√
    -   insertAfterIndex(SqlList &,int index,ElemType e);√
    -   traverseList(SqlList L);√
    -   emptyList(SqlList &L);√
    -   destroyList(SqList &L);√
    
####  2.LinkList List
-   DataStruct  √
-   Function
    -   void initList(LinkList  &L)  √
    -   int  getLength(LinkList L)    √
    -   bool insertList(LinkList &L,int index,ElemType e) √
    -   traverseLinkList(LinkList L);√
    -   bool getElemByIndex(LinkList L, int index, ElemType &e)√
    -   LNode*  locateElem(LinkList L,ElemType e);√
    -   LNode*  removeElem(LinkList &L,index i,ElemType &e);√
    -   void createLinkListByArray(LinkList &L,ElemType elem[],int n);√
    -   destroyList(SqList &L);√
    -   destroyList(SqList &L);√
        
#### 3.DuLinkList
-   DataStruct  √
-   Function
    -    void initList(DuLinkList &L);√
    -    int getLength(DuLinkList L);√
    -    bool insertList(DuLinkList &L,int index,ElemType);√
    -    void traverseList(DuLinkList L);√
    -    int locateElem(DuLinkList L,ElemType e);√
    -    bool getElementByIndex(DuLinkList L,int index,ElemType &e);√
    -    bool removeElementByIndex(DuLinkList L,int index,ElemType &e);√
    -    void destroyLinkList(DuLinkList &L);√
    
#### 4.DuCycleLinkList
-   DataStruct  √
-   Function
    -    void initList(DuLinkList &L);√
    -    int getLength(DuLinkList L);√
    -    bool insertList(DuLinkList &L,int index,ElemType);√
    -    void traverseList(DuLinkList L);√
    -    int locateElem(DuLinkList L,ElemType e);√
    -    bool getElementByIndex(DuLinkList L,int index,ElemType &e);√
    -    bool removeElementByIndex(DuLinkList L,int index,ElemType &e);√
    -    void destroyLinkList(DuLinkList &L);√
### Stack
#### 1.SequenceStack
-   DataStruct  √
-   Function
    -   void initStack(SqStack &, int maxSize, int increaseSize);√
    -   int getLength(SqStack L);√
    -   bool increment(SqStack &, int incrementSize);√
    -   bool push(SqStack &, ElementType);√
    -   bool pop(SqStack &,ElementType &);√
    -   bool isEmpty(SqStack L);√
    -   void traverse(SqStack L);√
    -   void empty(SqStack    &L);√
    -   bool getTop(SqStack L, ElementType &);√

#### 2.LinkStack
-   DataStruct  √
    -   void initStack(SqStack &, int maxSize, int increaseSize);√
    -   int getLength(SqStack L);√
    -   bool increment(SqStack &, int incrementSize);√
    -   bool push(SqStack &, ElementType);√
    -   bool pop(SqStack &,ElementType &);√
    -   bool isEmpty(SqStack L);√
    -   void traverse(SqStack L);√
    -   void empty(SqStack    &L);√
    -   bool getTop(SqStack L, ElementType &);√
### Queue
#### 1.SequenceQueue
-   DataStruct  
-   Function
    -   void initQueue(SqQueue &L, int maxSize = INIT_MAX_SIZE ,int incrementSize = INCREMENT_SIZE);√
    -   int getLength(SqQueue L);√
    -   bool isFull(SqQueue &L);√
    -   bool isEmpty(SqQueue &L);√
    -   bool enlarge(SqQueue &L);√
    -   bool enQueue(SqQueue &L,ElementType e);√
    -   bool deQueue(SqQueue &L,ElementType &e);√
    -   bool getHead(SqQueue L,ElementType &e);√
    -   void destroyQueue(SqQueue &L);√

#### 2.LinkQueue
-   DataStruct  
-   Function
    -   void initLinkQueue(LinkQueue &L);;√
    -   int getLength(LinkQueue &L);;√
    -   bool enQueue(LinkQueue &L,ElementType e);;√
    -   bool isEmpty(LinkQueue L);;√
    -   bool deQueue(LinkQueue &L,ElementType &e);;√
    -   bool getHead(LinkQueue L, ElementType &e) ;;√
    -   void destroy(LinkQueue &L) ;;√