当前位置：首页 > 搜索 "程序填空题"
程序填空题：DecreaseKey in a minheap
The function is to lower the value of the integer key at position P by a positive amount D in a minheap H.```c++void Dec…
程序填空题：BinQueue_Merge [3]
The function `BinQueue_Merge` is to merge two binomial queues `H1` and `H2`, and return `H1` as the resulting queue. ``……
程序填空题：BinQueue_Merge [2]
The function `BinQueue_Merge` is to merge two binomial queues `H1` and `H2`, and return `H1` as the resulting queue. ``……
程序填空题：IncreaseKey in a max-heap
The function is to increase the value of the integer key at position P by a positive amount D in a max-heap H.```c++void…
程序填空题：Merge two equal-sized binomial trees
The function is to merge two equal-sized binomial trees T1 and T2.```c++BinTree CombineTrees( BinTree T1, BinTree T2 ){……
程序填空题：Inserts X into a max-heap H
Please fill in the blanks in the program which inserts X into a max-heap H.```c++/* H-˃Element[ 0 ] is a sentinel */ voi…
程序填空题：Delete a node with minimal key from a min-heap
The function is to delete the node with minimal key from a min-heap H.```c++ElementType DeleteMin( PriorityQueue H ) {……
程序填空题：Percolates down a max-heap
Please fill in the blanks in the program which percolates down a max-heap.```c++void PercolateDown( int p, PriorityQueue…
程序填空题：Insert X into a binomial queue H
The function is to insert X into a binomial queue H.```c++BinQueue Insert( ElementType X, BinQueue H ){ BinTree Ca……
程序填空题：Lower the key in a min-heap
The function is to lower the value of the integer key at position P by a positive amount D in a min-heap H.```c++void De…
程序填空题：Find the Kth largest integer from a list
The function is to find the Kth largest integer from a list A of N(˃K) integers. The function BuildMinHeap(H, K) is to……
程序填空题：Deletes a given element at position p from a max-heap H
Please fill in the blanks in the program which deletes a given element at position p from a max-heap H.```c++Deletion (……
程序填空题：Find X in a binomial queue H
The function is to find X in a binomial queue H.```c++BinTree Find( BinQueue H, ElementType X )/* To find whether X i……
程序填空题：Merge two leftist heaps
The function is to merge two leftist heaps H1 and H2.```c++PriorityQueue Merge( PriorityQueue H1, PriorityQueue H2 ){……
程序填空题：Insert an element X into a min heap
The function is to insert an element X into a min heap.```c++/* H-˃Element[ 0 ] is a sentinel */void Insert( ElementTyp……
程序填空题：Merge two binomial queues H1 and H2
The function is to merge two binomial queues H1 and H2.```c++BinQueue Merge( BinQueue H1, BinQueue H2 ){ BinTree T1, T……
程序填空题：Insert an item into the hash table ht[]
The function is to insert an item into the hash table ht[] with the hash function hash. Here a list node contains item……
程序填空题：分段函数
计算分段函数，测试数据分别是-2、3、7。```c++#include @@[#include ](3)int main( ){ float x,f; int i; for (i=0; i˂3; i++) {……
程序填空题：猴子吃桃
猴子第一天摘下若干个桃子，当即吃了一半，还不过瘾又多吃了一个。第二天早上有将剩下的挑子吃掉一半，又多吃了一个。后每天早上都吃了前一天剩下的一半零一个。到第day（通过键盘输入）天早上想再吃时，只剩下一个挑子了。求第一天共摘了多少桃子。输入1…
程序填空题：计算部分质数之和
计算0到200之间所有个位数字是3或7的质数之和，将答案填在空里： @@[2200](8)。注意：仅填写结果数值，不要填写多余文字或者空格之类字符。提示：可以手算，也可以编写一段C程序运行求解。答案：第1空：2200……