信管网cnitpm3913879***: [回复] 1) int max;
max = a -> int_arr[0];
return max;
2)a.remove(0);
3)1
4)a->array-size > 0
5)heapify(a,a->array_size,0)
6)o1
7)logn0
8)nlogn0
9)4
信管网cnitpm475547856***: [回复] a->int_array[0] a->int_array[0]=a->int_array[a->array_size-1] a->capacity iarray_size
o(n),o(n),o(n2) 10
信管网cnitpm467495558***: [回复] (9)3
|