Brush title Inscription

Brush with the flow a wave of questions, about the recording knowledge, continuously updated.

Time complexity: O (1) = line of code, O (log ₂ n  ) = n-2 as a substrate for several calculation (2 ^{. 3} =. 8> log ₂ . 8 =. 3), O (n) = n times calculation (n times for / while loop), O ( n- ^m ) m = n-th power of operation times (n / m times for / while nested loop).

 Median: takes a value intermediate position of the sorted set of array elements. When the length of the array is odd: takes an intermediate bit value> M _{(length + 1) / 2} ; if the length of the array is an even number: 2 takes an intermediate mean> (M _{length / 2} + M _{(length / 2 + 1)} ).

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Word Digital Digital Digital Digital Digital Digital Digital Digital Digital Digital Digital Digital Digital Digital Digital Digital Digital Digital Digital Digital Digital Digital number