Assignment : Data structure and Algorithm
Student Name : Umair Khalid
Reg# : Cpen18111022
Submitted to : Engr. Hammad Shahab
----------------------------------------------------------------------------------------------------------
Q.1 Worst-case complexity.
In computer science, the complexity of the worst case scenario (usually the asymptomatic
symbol) measures the resources (such as running time, memory) that are given input at an
arbitrary size by the algorithm (usually N or NK). Also known as). It sets a limit on the resources
required by the algorithm.
1. Two loops in a row:
1. for (x = 0; x < A; x++) { sequence of statements
2. } for (y = 0; y < B; y++) { sequence of statements }
The first loop is O (A) and the second loop is O (B). Since we don't know which one is bigger, we
say it's O (A + B). It can also be written as O (maximum (A,B)). In the case where the second
loop goes to A instead of B, the complication is O (A). We can see it from the expression above.
O (A + B) becomes O (2A) and when we drop it permanently it becomes O (A). O (Max (A, B))
becomes O (Max (A, A)) which is O (A).
2. A nested loop followed by a non-nested loop:
1. for (x = 0; x < A; x++) { for (y = 0; y < A; y++) { sequence of statements}}
2. for (z = 0; z < A; z++) { sequence of statements
The first set of nested loops is O(A^2) and the second loop is O(A). This is O(max(A2,A)) which is O(A2).
Q.2 : Circular link list.
Circular LinkedIn List is a variant of a linked list in which the first element refers to the last
element and the last element refers to the first element. Both single linked list and double
linked list can be made circular linked list.
C++ Code
#include <bits/stdc++.h>
using namespace std;
class Node
