"worst part telling of birthday for your dorm mate at campus  they spill water on your clothes, making you feel damp, but the good part is being able to chill with them. I want to say thank you to all of my dorm mates and friends for making this day unforgettable.

Linear searching

#include<iostream>
using namespace std;
int Binary_Searching(int[],int,int);
int main()
{
    int list[]= {1,2,3,4,7};
    int key=7;
    int size =sizeof(list)/sizeof(list[0]);

    int n=Binary_Searching(list,key,size);
    cout<<n;
    return 0;
}

int Binary_Searching(int list[],int key,int size) {

    int low=0;
    int index,mid;
    int high=size-1;
    int found=0;
    do {
         mid=(high+low)/2;
        if(key==list[mid])
            found=1;
        else if(list[mid]>key)
            high=mid-1;
        else if(list[mid]<key)
            low=mid+1;
    }while(found==0 && low<=high);

    if (found==0)
        index=-1;
    else
        index=mid;

    return index;

}

Selection sorting

#include<iostream>
using namespace std;
int main()
{
int array[]= {6,8,2,9,3};
int n=sizeof(array)/sizeof(int);
int smallest,i,j,temp;
for(i=0; i<n; i++) {
smallest=i;
for(j=i+1; j<n; j++) {
if(array[j]<array[smallest]) {
smallest=j;
}
if(smallest!=i) {
temp=array[smallest];
array[smallest]=array[i];
array[i]=temp;
}
}
}
for(i=0; i<n; i++)
cout<<array[i]<<endl;
}

If you have any question feel free to ask anything .I am here to help

Bot:@Knowledgewis_bot