Anthony-黄亮

摘要： Binary-Search (A, x) l = 0, r = A.length while l A[i]: l = i + 1 else return i return -1 // Not-FoundInsert-Sort (A) for i = 1 to A.length test = A[i] j = i - 1 while j >= 0 and test < A[j]: //Ascend A[j+1] = A[j] A[j+1] = testDFS(solutioin) if solution is ok: process(solut... 阅读全文