UaoSonic

编写一个算法，统计出单链表中结点的值等于给定值x的结点数 int TJ(LinkList& head, datetype x) { int count=0; LinkNode* p; if(head == NULL) return 0; p = head; while(p!=NULL) { if(p->date==x) count=count+1; p=p->nex

冒泡排序 //冒泡排序 var dataStore = [1,0,3,3,5,4,5,0,6,7]; var temp; var exchange = 1; for(var i = 0; i<dataStore.length&&exchange; i++){ exchange = 0; for(var j = dataStore.length-2; j&...