int main() { int n; LinkList list=NULL,result=NULL; scanf("%d",&n); InitialList(list,n); InitialList(result,0); Convert(list,result); printf("The List is:"); LoadList(list); printf("The turned List is:"); LoadList(result); return 0; }
void test_Increment(void) { LIST_TYPE list = NULL; Status result = InitialList(&list); int size = LIST_INITIAL_SIZE + LIST_INCREMENT; CU_ASSERT_EQUAL(result, OK); if (result != OK) return; int i = 0; for (i = 0; i < size - 1; i++) { result = ListInsert(list, 1, i); CU_ASSERT_EQUAL(result, OK); if (result != OK) return; } CU_ASSERT_EQUAL(list -> listsize, size); CU_ASSERT_EQUAL(list -> length, size - 1); for (i = 0; i < size - 1; i++) { CU_ASSERT_EQUAL(*(list -> element + i), size - i - 2); } }
int main(int argc, const char * argv[]) { Node *pList; InitialList(&pList); CreateListTailInsert(pList); PrintList(pList); BubbleSort(pList); return 0; }
int main(int argc, const char * argv[]) { Node *pList; InitialList(&pList); CreateListTailInsert(pList); PrintList(pList); DeletePosNode(pList, 2); PrintList(pList); DeleteValueNode(pList, 5); PrintList(pList); return 0; }