the Big O notation for this pseudocode
What would be the Big O notation for this pseudocode and the total time cost (I made it for a hashtable):
(SIDE NOTE: I have attached Big O notation table and
FUNCTION InsertCourse(Course courseData) {
CREATE key for the given courseData
RETRIEVE node using key
IF (no entry found for key)
ASSIGN this node to the key position
END IF
ELSE
IF (node is not used)
SET old node to key to key
SET old node to courseData
SET old node next to NULLPTR
END IF
ELSE
WHILE (old node next is not NULLPTR)
ADD new node to the end
END WHILE
SET old node next to new Node (courseData, key)
END ELSE
END FUNCTION
![Code (Vector)
OPEN/ READ file
NUMBER of file lines read EQUALS N
VECTOR <COURSE> courseData (N)
FOR (int i = 0; i < N; increment i)
APPEND courseData[il.courseNumber
APPEND courseData[il.courseTitle
APPEND courseData[i] Prerequisites[]
Line Cost
1
1
1
1
1
1
1
# Times
Executes
n
1
1
1
1
n
Total Cost
Runtime
Total
Cost
n
1
1
n
1
1
n
3n + 4
O(n)](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fd64ab373-a88e-44d8-82cb-e807d46ce9ab%2F226495dd-54f1-403d-af89-dcbfe5301cbd%2Fxz1n4tc_processed.jpeg&w=3840&q=75)
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
