(42) Given a floating-point number to find a closest value in a sorted array of n floating-point numbers. (A)O(n log n) (B)O(log n) (C)O(n2) (D)O(n3) (E)O(n)

(42) Given a floating-point number to find a closest value in a sorted array of n floating-point numbers.
(A)O(n log n)
(B)O(log n)
(C)O(n²)
(D)O(n³)
(E)O(n)

答案：登入後查看
統計： 尚無統計資料

詳解 (共 1 筆)

MoAI - 您的AI助手

B1 · 2025/11/16

#7101496

題目解析題目要求我們在一個已經排序的...

(共 927 字，隱藏中）

前往觀看

複選題(47) Suppose there are 5 vertices, v1, v2,... , v5 and the weight between vi and vj is ((i-j)*(i-j) mod 5)+1, where i≠j. Which of the followings is correct? (A) There is no solution for this input. (B) The weight of the optimal solution between any pair of vertices is 2. (C) There is a pair of vertices which has the optimal solution as 5. (D) The optimal path between any pair of vertices is unique. (E) The optimal path and the shortest path between v2 and v4 are the same path.

(42) Given a floating-point number to find a closest value in a sorted array of n floating-point numbers.
(A)O(n log n)
(B)O(log n)
(C)O(n²)
(D)O(n³)
(E)O(n)

詳解 (共 1 筆)

相關試題

相關試卷