Consider two recursive algorithms A and B to solve a problem. The recurrences corresponding to their running times are

A. T(m) = 2T(m/2)+m²

B. T(m) = 8T(m/4)+10m²​

Which of these algorithms is faster (i.e., more efficient)?

What is the time complexity of the Floyd-Warshall all shortest path algorithm for a graph with V vertices? Select the tightest bound.

Якою буде відносна нев’язка

Consider the following statement: 

"In order to solve the recurrence T[n]=7·T[n/8]+n by the Master method, you will need to check the regularity condition."

Select every correct answer below (More than one choice could be selected. You may lose points for wrong selections). 

• Counting Sort is a comparison-based sorting algorithm.
• Counting Sort is inefficient when input elements are drawn from a small range.
• Counting Sort is a stable sorting algorithm.
• Counting Sort runs in linear time when the range of input values is not significantly larger than the number of elements.
• Counting Sort can efficiently sort floating-point numbers.
• Counting Sort has a worst-case time complexity of O(n log n) and this bound is tight.

How many of the following statements about Counting Sort are true?

Вкажіть розмір ставки єдиного внеску на загальнообов’язкове державне  соціальне страхування для підприємств,

установ і організацій, у яких працю­ють люди з інвалідністю, а також розрахунок максимальної та мінімальної  величини

бази нарахування єдиного внеску

Яку розмірність має абсолютна похибка?

Дано

визначення класів:

class C1 {

};

class C2 {

           C1 *f1;

//

};

Which statement is true about the recurrence relation T(m)=9T(m/9)+m·log(m)?

Яку

з п