What requirement is placed on an array, so that binary search may be used to locate an entry? 1.The array must be sorted. 2.The array must have at least 2 entries. 3.The array’s size must be a power of two.
What requirement is placed on an array, so that binary search may be used to locate an entry?
1.The array must be sorted.
2.The array must have at least 2 entries.
3.The array’s size must be a power of two.
2) Determine the Big O( ) notation for the following:
(m + n)(10n3 + 50n)
O(mn3+ n4)
O(mn4+ n3)
What is the right code for the following method:
Mystery(x) : counts the number of x occurrences in a linked list with head reference on the first node in the list.
int Mystery( int x){
int count = 0;
Node current = head;
while(current != null){
if( current.element == x)
count++;
current = current.next;
}
return current;
}
int Mystery( int x){
int count = 0;
Node current = head;
while(current != null){
if( current.element == x)
count++;
current = current.next;
}
return count;
}
int Mystery( int x){
int count = 0;
Node current = head;
while(current.next != null){
if( current.element == x)
count++;
current = current.next;
}
return count;
}
O(nm4+ m3)
O(nm3+ m4)
If both pointers of the node in a binary tree are NULL then it will be a/an _______ .
Root node
Leaf node
Inner node
None of the given options
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
