代码搜索：Output
找到约 10,000 项符合「Output」的源代码
代码结果 10,000
www.eeworm.com/read/259580/11781324
output hanoiusingstacks.output
Moves for a three disk problem are
Move disk 1 from tower 1 to top of tower 2
Move disk 2 from tower 1 to top of tower 3
Move disk 1 from tower 2 to top of tower 3
Move disk 3 from tower 1 to top
www.eeworm.com/read/259580/11781327
output insert.output
a[0:6] = 1 2 4 6 8 10 12
After inserting 14, a[0:7] = 1 2 4 6 8 10 12 14
After inserting 5, a[0:8] = 1 2 4 5 6 8 10 12 14
After inserting 0, a[0:9] = 0 1 2 4 5 6 8 10 12 14
www.eeworm.com/read/259580/11781340
output skiplist.output
The dictionary is 1 5 2 10 6 30 8 40 10 50 12 60
Its size is 6
Element associated with 1 is 5
Element associated with 6 is 30
Element associated with 12 is 60
Deleted 1, 2, 6, 12
The dict
www.eeworm.com/read/259580/11781369
output d.output
a[0:9] = 1 2 3 4 5 6 7 8 9 10
Completed function d(y,10)
a[0:9] = 3 7 9 11 13 15 9 8 11 10
www.eeworm.com/read/259580/11781373
output inef.output
a[0:5] = 1 2 3 4 5 6
The prefix sums are 1 3 6 10 15 21
www.eeworm.com/read/259580/11781382
output wirerouter.output
Enter grid size
Enter the start position
Enter the finish position
Enter the wiring grid in row-major order
The wire path is
4 2
5 2
5 3
5 4
6 4
6 5
6 6
5 6
4 6
www.eeworm.com/read/259580/11781424
output earlybubblesort.output
a[0:9] = 10 9 1 2 3 4 8 7 6 5
After the sort, a[0:9] = 1 2 3 4 5 6 7 8 9 10
www.eeworm.com/read/259580/11781427
output adjacencywgraph.output
Number of Vertices = 4
Number of Edges = 0
The graph is
Number of Vertices = 4
Number of Edges = 4
0 3 2 4
3 0 0 5
2 0 0 0
4 5 0 0
The graph after deleting (2,1) is
www.eeworm.com/read/259580/11781446
output linkedstack.output
Stack should be 1234, bottom to top
The stack is not empty
The stack size is 4
Stack top is 4
Popped top element
Stack top is 3
Popped top element
Stack top is 2
Popped top element
Stack top