Skip to main content

Table 2 Complexity of the algorithm phases

From: Decreasing the execution time of reducers by revising clustering based on the futuristic greedy approach

Phase

Complexity

Complexity of phase 1

\(O\left( N \right)\)

Complexity of phase 2

\(O\left( {\frac{{N^{2} }}{n}} \right) + O\left( N \right) + O\left( N \right)\)

Complexity of phase 3

\(O\left( {P^{2} *logP} \right)\)

Complexity of phase 4

\(O\left( P \right)\)

Complexity of phase 5

\(O\left( N \right)\)