Question: Given this algorithm: List createList ( int N ) { List L = new List ( ) ; for ( int k = 1 ;

Given this algorithm:
List createList( int N )
{
List L = new List();
for (int k=1; k<=N; k++)
L.add(0, new Integer(k));
return L;
}
What is the Big-O?

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!