Scribd
Upload
24 views

The Graph Shows That The Time Complexity Is of O (N) For Values Greater Than 5000, But I Could Not Get O (N) For Less Than 5000

The graph shows that the algorithm's time complexity is O(N) for numbers of elements greater than 5000, as evidenced by the linear trendline. However, the time complexity could not be shown to be O(N) for fewer than 5000 elements. The graph plots time taken in milliseconds on the y-axis against number of elements on the x-axis, with an R-squared value of 0.994 for the linear trendline, indicating a linear relationship when number of elements is greater than 5000.

Uploaded by

MOFEEZALAM
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
24 views

The Graph Shows That The Time Complexity Is of O (N) For Values Greater Than 5000, But I Could Not Get O (N) For Less Than 5000

The graph shows that the algorithm's time complexity is O(N) for numbers of elements greater than 5000, as evidenced by the linear trendline. However, the time complexity could not be shown to be O(N) for fewer than 5000 elements. The graph plots time taken in milliseconds on the y-axis against number of elements on the x-axis, with an R-squared value of 0.994 for the linear trendline, indicating a linear relationship when number of elements is greater than 5000.

Uploaded by

MOFEEZALAM
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

The graph shows that the time complexity is of O(N) for values greater than 5000, but i could

not get
O(N) for less than 5000 .

Fig: Time Vs Number of Elements
y = 0.0003x + 0.1898
R = 0.994
0
1
2
3
4
5
6
7
8
0 10000 20000 30000
m
s

Number of Element
Series1
Linear (Series1)

You might also like