int main(){ // create queue int queue[QUEUE_SIZE]={0}; int rear = 0; int front = 0; int choice; while(1){ showInitile(); choice = getChoice(); switch(choice){ case 1: displayQueue(queue); break; case 2: Enqueue(queue, &rear, &front); break; case 3: delqueue(queue, &rear, &front); break; case 4: system("CLS"); break; default: printf("你壞壞\n"); break; } } system("pause"); return 0; }
void displayQueue(QNode* q) { if(q== NULL) return; printf("%u ",q->pageNumber); displayQueue(q->next); }
int main() { readGraph(); displayListAdjacency(); BFS(); displayQueue(); return(0); };
void delqueue(int queue[QUEUE_SIZE], int *rear, int *front){ if(isEmpty(queue, rear, front)){ printf("the queue is already empty\n"); } else { *front = *front + 1; printf("Before: %d\n", queue[*front]); queue[*front] = 0; printf("After: %d\n", queue[*front]); } displayQueue(queue); }
void Enqueue(int queue[QUEUE_SIZE], int *rear, int *front){ int value; if(isFull(queue, rear, front)){ printf("the queue is already Full\n"); } else { printf("Plz type value:"); scanf(" %d", &value); *rear = *rear + 1; if(*rear == QUEUE_SIZE){ *rear = 0; } queue[*rear] = value; } displayQueue(queue); }
std::string MovePriorityQueue::toMoveDetailString() { MovePriorityQueue displayQueue(*this); std::string returnString; returnString += "["; while(!displayQueue.isEmpty()) { int node = displayQueue.backingArray[0]; int priority = displayQueue.priorityArray[0]; returnString += " "; returnString += MoveToString(node) + "(" + int_to_string(priority) + ")"; displayQueue.removeMaximum(); } returnString += "]"; return returnString; }
std::string MovePriorityQueue::toMoveString() { MovePriorityQueue displayQueue(*this); std::string returnString; returnString += "["; while(!displayQueue.isEmpty()) { int node = displayQueue.backingArray[0]; returnString += " "; returnString += MoveToString(node); displayQueue.removeMaximum(); if (!displayQueue.isEmpty()) returnString += ","; } returnString += "]"; return returnString; }
void displayOBSTInfo(OBSTComputation *obstComp) { BinaryTree *obst = obstComp->getOBST(); double timeTaken = obstComp->getTimeTaken(); double averageCase = obstComp->getAverageTime(); int worstCase = maxHeight(obst) - 1; double stdDev = obstComp->getStandardDeviation(); double eOfXSquared = obstComp->getEOfXSquared(); queue<int> levelOrderTraversal = levelOrderTraversalWrapper(obst, 7); cout << "Level Order Traversal: "; displayQueue(levelOrderTraversal); cout << "Program completed in " << timeTaken << " seconds" << endl << "Total Frequencies: " << obstComp->getTotalFrequencies() << endl << "Total Nodes: " << obstComp->getTotalNodes() << endl << "Best Case: 1" << endl << "Average Case: " << setprecision(3) << averageCase << endl << "Worst Case: " << worstCase << endl << "E[X^2] = " << eOfXSquared << endl << "Standard Deviation: " << stdDev << endl << "Sum of Frequencies: " << obstComp->getSumOfFrequencies() << endl; }
int main(int argc, const char * argv[]) { int choice = 0; while(1){ printf("1. Add element to queue.\n"); printf("2. Delete element from queue.\n"); printf("3. Display queue.\n"); printf("4. Exit.\n"); printf("Choice: "); scanf("%d", &choice); switch (choice) { case 1: addElement(); break; case 2: deleteElement(); break; case 3: displayQueue(); break; case 4: exit(1); break; default: break; } } return 0; }
void test_print_queue(){ displayQueue(queue); ASSERT(1); }