A vertex with no incoming edges is called

What is the worst-case running time of the searching phase in Boyer-Moore's algorithm?

What is the most efficient sorting algorithm to sort 10 million elements?

What is the time complexity of the insertion sort algorithm when the inputs are pre-sorted?

Which of the following searching algorithms is the fastest?

In a stack algorithm, the set of pages in an n-frame memory is always a subset of pages in a __________ frame memory.

Introsort algorithm is a combination of which two sorting algorithms?

Consider a sequence of 14 elements: A = [-5, -10, 6, 3, -1, -2, 13, 4, -9, -1, 4, 12, -3, 0]. The subsequence sum Determine the maximum of S(i,j), where 0 ≤ i ≤ j < 14. (Divide and conquer approach may be used)

What is the base case in the following recursive function?

void my_function(int n)
{
    if(n == 0)
    return;
    printf("%d ",n);
    my_function(n-1);
}
int main()
{
    my_function(5);
    return 0;
}

Let G = (V, G) be a weighted undirected graph and let T be a Minimum Spanning Tree (MST) of G maintained using adjacency lists. Suppose a new weighed edge (u, v) ∈ V×V is added to G. The worst case time complexity of determining if T is still an MST of the resultant graph is