Home > Back-end >  The order table c implementation
The order table c implementation

Time:03-06

# include & lt; iostream>
# define ElemType int
Const int ListInitSize=7;
using namespace std;
Struct SList
{
ElemType * elem;
Int length;
Int listsize;
};
Bool ListCreate (SList & amp; Int L, n, ElemType a [])
{
L.e lem=new ElemType [n + ListInitSize];
if(! L.e lem) return false.
L.l ength=n;
L.l istsize=n + ListInitSize;
return true;
}

1. With my program to write a simple order table (don't any other functions)
2. Delete the order table is greater than the elements of x
3 q
  • Related