题目内容
20 When performing the binary search on a linear table, the linear table must be ( ).
查看答案
搜索结果不匹配？点我反馈
更多问题
1.If you only want to get the sequence before the fifth smallest element in the sequence of composed 1000 elements, the ( ) method is the fastest.
2 The following four sequences are sorted (from small to large) by direct insertion sort method, and the element comparison is ( ) with the least number of times.and the least number of element comparisons is（）.
3 There is a set of data (15, 9, 7, 8, 20, - 1, 7, 4), and the initial heap created by the heap sort filtering method is ( ).
4.If the key words of a group of records are (46,79,56,38,40,84), the result of a division based on the first record is ( ) by using the method of quick sort.
微信支付 
支付宝支付