Given the array [88, 56, 100, 2, 25], and the selection sort algorithm to sort this array in increasing order, what will the array look like after the first two elements are placed in their correct sorted order?

How does interpolation search algorithm estimate the position of the key in a sorted array?

Скільки дорівнюватиме теоретична

сума

Дано

визначення класів і об’єктів:

class A {

  public:

          int a;

};

class B: public A {

  public:

          int b;

};

class C: public A, public B {

  public:

          int c;

};

class D: public B, public C {

  public:

          int d;

};

A oA;

B oB;

C oC;

D oD;

      Якими будуть розміри об’єктів оA, oB, oC, oD ? (дані

типу int займають 4 байти)

      Записати всі поля об’єктів оA, oB, oC, oD

Which of the following statements about Insertion Sort is correct?

Поляризація світла — просторова орієнтація магнітної складової частини електромагнітної хвилі.

In the Floyd-Warshall all shortest path algorithm, what is the purpose of introducing an intermediate vertex k during iteration?

Which of the following scenarios would cause the greedy approach (rational knapsack algorithm, choosing items by highest value-to-weight ratio) to fail in solving the 0/1 (or binary) knapsack optimally?

Based on the discussion from our lectures, what is the running time of the preprocessing step of the string matching algorithm with finite automata (i.e., of the step where we compute the transition function)? Recall that n, and m are the sizes of the text and pattern, respectively, and Σ is the alphabet. (Choose the tightest bound.)