I think it is O(n) in the worst situation

Author: hex108

C++/chapLinearList.tex

@@ -234,7 +234,7 @@ \subsubsection{分析}
 \subsubsection{代码}
 \begin{Code}
 // LeetCode, Search in Rotated Sorted Array II
-// 时间复杂度O(log n)，空间复杂度O(1)
+// 时间复杂度O(n)，空间复杂度O(1)
 class Solution {
 public:
     bool search(int A[], int n, int target) {