选择问题的最坏时间复杂度T(n)=（ ）\n \n \n \n \n \n \n

\n \n \n \n A.\n O(1)\n

\n \n

\n \n \n \n B.\n O(n)\n

\n \n

\n \n \n \n C.\n O(log n)\n

\n \n

\n \n \n \n D.\n O(

)