Scribd
Upload
10 views6 pages

Time Complexity Examples

Uploaded by

vc6094055
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
10 views6 pages

Time Complexity Examples

Uploaded by

vc6094055
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Time complexity examples

1)
for (int i = 0; i < n; i++) {
Printf(“Hello”);
}

2)
int main()
{
for(int i=1;i<=m;i++) {
Printf(“simran”);
}
for(int j=1;j<=n;j++) {
Printf(“ujjwala”);
}
return 0;
}

3)
int main()
{
for(int i=1;i<=m;i++) {
for(int j=1;j<=n;j++) {
Printf(“Yash”);
}
}
return 0;
}
4)
int main()
{
for(int i=1;i<=n;i=i+2) {
printf("Gangadhar");
}
return 0;
}

5)

int main()
{
int i,j,k,n;
for(i=1;i<=n;i++){
for(j=1;j<=i;j++){
for(k=1;k<=100;k++){
printf("Rohan Kumar");
}
}
}
return 0;
}

6)

int main()
{
int i;
for(i=1;i2<=n;i++){
printf("samarth");
}
return 0;
}
7)
int main() {
int i,j,k,n;
for(i=1;i<=n;i++){
for(j=1;j<=i2;j++){
for(k=1;k<=n/2;k++){
printf("somya");
}
}
}

return 0;
}

8)
int main() {
int i,n;
for(i=1;i<=n;i=i*2){
printf("satyam");
}
return 0;
}

9)

int main()
{
if(condition) {
for(int i=1;i<=n;i++) {
printf("i am in if loop");
}
}
else{
for(int j=1;j<=n;j=j*2) {
printf("i am in else loop");
}
}
return 0;
}
10)
int main() {
int i,j,k,n;
for(i=n/2;i<=n;i++){
for(j=1;j<=n/2;j++){
for(k=1;k<=n;k=k*2){
printf("Siddharth");
}
}
}
return 0;
}

11)
int main() {
int i;
for(i=100;i>1;i=i/2){
printf("Shreyansh");
}
}

12)
int main() {
int i,j,n;
for(i=1;i<=n;i++){
for(int j=1;j<=n;j=j+i){
printf("Shivani");
}
}
}
13)
int recursiveFun1(int n)
{
if (n <= 0)
return 1;
else
return 1 + recursiveFun1(n-1);
}

14)
int recursiveFun2(int n)
{
if (n <= 0)
return 1;
else
return 1 + recursiveFun2(n-5);
}

15)
void recursiveFun4(int n, int m, int o)
{
if (n <= 0)
{
printf("%d, %d\n",m, o);
}
else
{
recursiveFun4(n-1, m+1, o);
recursiveFun4(n-1, m, o+1);
}
}
16)
int recursiveFun5(int n)
{
for (i = 0; i < n; i += 2) {
// do something
}

if (n <= 0)
return 1;
else
return 1 + recursiveFun5(n-5);
}

17)
int Fibonacci(int n){
if(n==1 or n==0)
return 1;
return Fibonacci(n-1) + Fibonacci(n-2);
}

You might also like