- 博客(6)
- 收藏
- 关注
RSS订阅转载 remove1
Error_code List::remove(int position, List_entry &x) { if(count==0) return underflow; if(position=count) return range_error; x=entry[position]; for(int i=position;i
2013-09-26 19:51:15
393
转载 REMOVE
Error_code List::remove(int position,List.entry &x) { if(count==0) return underflow; if(position=count) return range_enor; Node *new_node,*previous,*followig; if(positio
2013-09-26 19:40:31
370
原创 Exercises4.2 And Exercises4.3
Exercises 4.2 E2 Consider a linked stack that includes a method size .That method size requires a loop that moves through the entire stack to count the entires,since the number of entries in the
2013-09-12 17:54:46
589
原创 Homework Exercise4.1 E1 E2
Homework exercise4.1 E1 E2 Draw a diagram to illustrate the configration of linked nodes that is created by the following statements. Node *p0=new Node(‘0’); Node *p1=p0->next=new Node(‘1
2013-09-05 18:34:50
592
转载 HOMEWORK exercise3.3 E7
Rewrite the methods for queue processing from the text ,using a flag to indicate a full queue instead of keeping a count of the entries in the queue The class definition for this Queue impleme
2013-09-05 17:43:43
539
转载 homework exercise2.2 E2(b)
采用栈的方法，为下面的说明编写一个函数copy_stack： Error_code copy_stack(Stack &dest , Stack &source); 前置条件：无 后置条件：Stack dest已经成为Stack source的一个完全副本，而source未被改变。如果检测到错误，则返回一个合适的代码，否则返回success。 写出函数： 使用
2013-09-05 16:10:04
616
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人