Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
class LS
public:
{ int found = 0;
if (value == arr[i] )
found = 1;
break;
if (found == 1)
else
}
};
int main()
{ int num;
cin>>num;
int array[num];
cin>> array[i];
cin>>keynum;
LS l1;
l1.LinearSearch(array,keynum,i,num);
return 0;
}
Q.2.multipication of matrix
#include <iostream>
int main(){
int matrix1[3][3] = { { 1, 2, 3 }, { 4, 5, 6 }, { 7, 8, 9 } };
int matrix2[3][3] = { { 1, 2, 3 }, { 4, 5, 6 }, { 7, 8, 9 } };
int results[3][3];
int product = 0;
int i;
int j;
results[i][j] = product;
product = 0;
system("pause");
return 0;
output
q.3. insertion sort
#include<iostream>
int key, j;
j = i;
array[j] = array[j-1];
j--;
int main() {
int n;
cin >> n;
display(arr, n);
insertionSort(arr, n);
display(arr, n);
output
q.4. selection sort
#include<iostream>
int temp;
temp = a;
a = b;
b = temp;
int i, j, imin;
imin = j;
swap(array[i], array[imin]);
int main() {
int n;
cin >> n;
display(arr, n);
selectionSort(arr, n);
display(arr, n);
output
Q.5. buble sort
#include<iostream>
int temp;
temp = a;
a = b;
b = temp;
swapping(array[j], array[j+1]);
if(!swaps)
int main() {
int n;
cin >> n;
display(arr, n);
bubbleSort(arr, n);
display(arr, n);
output
q.6. binary search
#include<iostream>
int main()
int n,i,a[100],e,res;
cin>>n;
for(i=0;i<n;++i)
cin>>a[i];
}
cout<<"\nEnter element to search:";
cin>>e;
res=search(a,n,e);
if(res!=-1)
else
return 0;
int f,l,m;
f=0;
l=n-1;
while(f<=l)
m=(f+l)/2;
if(e==a[m])
return(m);
else
if(e>a[m])
f=m+1;
else
l=m-1;
return -1;
Output;