Lab Task No 1

Submitted By:
Shraize Ali
Submitted Too:
Sir Hafiz Muhammad Adnan
Roll No:
19482
Department:
BSSE(E)
Subject:
Data Structure & Algorithm
 Bubble Sort

1. #include<iostream>
2. using namespace std;
3. int main()
4. {
5. int arr[5],i,j,temp;
6. for(i=0;i<5;i++)
7. {
8. cout<<"enter value:";
9. cin>>arr[i];

10.}
11.cout<<"The original value in arr:\n";
12.for(i=0;i<5;i++)
13.cout<<arr[i]<<" ";
14.for(i=0;i<5;i++)
15.for(j=0;j<4;j++)
16.if(arr[j]>arr[j+1])
17.{
18.temp =arr[j];
19.arr[j]=arr[j+1];
20.arr[j+1]=temp;
21.}
22.cout<<"\nSorted arr are:\n ";
23.for(i=0;i<5;i++)
24.cout<<arr[i]<<" ";
25.return 0;
 Selection Sort
1. #include<iostream>
2. using namespace std;
3. int main()
4. {
5. int arr[5],i,j,temp,min;
6. for(i=0;i<5;i++)
7. {
8. cout<<"enter value:";
9. cin>>arr[i];

10.}
11.cout<<"The original value in arr:\n";
12.for(i=0;i<5;i++)
13.cout<<arr[i]<<" ";
14.for(i=0;i<4;i++)
15.{
16.min=i;
17.for(j=i+1;j<5;j++)
18.{
19.if(arr[j]<arr[min])
20.min=j;
21.}
22.if (min!=0)
23.{
24.temp =arr[i];
25.arr[i]=arr[min];
26.arr[min]=temp;
27.}
28.}
29.cout<<"\nSorted arr are:\n ";
30.for(i=0;i<5;i++)
31.cout<<arr[i]<<" ";
32.return 0;
33.}

Recursion Table
1. #include <iostream>
2. using namespace std;
3. void mul_table(int n, int i)
4. {
5. if (i > 10)
6. return;
7. cout<< n<< " * "<< i <<" = "<<n * i<< endl;
8. return mul_table(n, i + 1);
9. }
10.int main()
11.{
12.int n = 5;
13.mul_table(n, 1);
14.return 0;
15.}
 Factorial using Recursion Function

1. #include<iostream>
2. using namespace std;
3. int factorial(int num);
4. int main()
5. {
6. int fact_num;
7. int num;
8. cout << "Enter any number:";
9. cin >> num;
10.if(num < 0)
11.cout<<"negative number fctorial is not displayed";
12.else
13.{
14.fact_num = factorial(num);
15.cout << "Factorial of the given number is "<<fact_num;
16.}
17.return 0;
18.}
19.int factorial(int num)
20.{
21.if (num == 0)
22.return 1;
23.else
24.return(num * factorial(num - 1));
25.}