0 votes
0 answers
31
0 votes
0 answers
32
The minimum number of comparisons required to determine if an integer appears more than n/2 times in a sorted array of n integers is:a) O(logn)b)O(n)c)O(1)d)O(log*n)
0 votes
0 answers
33
can anyone explain why is L1 regular???Let L1 = {w ∈ {0,1}∗ | w has at least as many occurrences of (110)’s as (011)’s}.