Energy Conservation Using Dynamic Voltage Frequency Scaling for Computational Cloud

Table 2

Algorithm and time complexity.

S. number	Algorithm type	Worst-case function	Variables and their definitions	Mathematical functions
1	Linear algorithm		Number of entities to be linear-searched	For all when; or when is 1 to
2	Binary search algorithm		is the number of entities to be binary-searched	,; where
3	Geometric algorithm		gr is a constant geometric multiplier and is the number of entities	for
4	Merge algorithm		Number of entities to be merged
5	Warshall and Floyd’s algorithm		is the number of vertices within a network
6	Backtracking algorithm		is the number of entities to be backtracked
7	-means clustering algorithm		and (the dimension) are fixed, the problem can be exactly solved, where is the number of entities to be clustered