Data-Structure-Programs/selection_sort.cpp at master · akshay2742/Data-Structure-Programs · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
#include<iostream>
using namespace std;

void selection_sort(int a[],int n)
{
    int i,j;
    int temp=0;
    for ( i = 0; i < n-1; i++)
    {
        for ( j = i+1; j < n; j++)
        {
            if (a[i]>a[j])
            {
               temp=a[i];
               a[i]=a[j];
               a[j]=temp;
            }
        }

    }
}

void bubble_sort(int a[],int n)
{
    int i,j;
    int temp=0;

    for ( i = 0; i <n-1; i++)
    {
        for ( j = 0; j < n-i-1; j++)
        {
            if (a[j]>a[j+1])
            {
                temp=a[j];
                a[j]=a[j+1];
                a[j+1]=temp;
            }
        }
    }

}

void linear_search(int a[],int size,int n)
{
    int i;
    int count=0;
    for ( i = 0; i < size; i++)
    {
        if (a[i]==n)
        {
            count=1;
            break;
        }
        else
        {
            count=0;
        }


    }
    if (count==1)
    {
        cout<<"Element is found at index: "<<i;
    }
    else
    {
        cout<<"Element is not found";
    }
}

void binary_search(int a[],int size,int n)
{
    int first,end,mid,i;
    int count=0;

    first=0;
    end=size-1;
    mid=(first+end)/2;
    while ( first<=end)
    {
        if (a[mid]<n)
        {
            first=mid+1;
            mid=(first+end)/2;
        }
        if (a[mid]>n)
        {
            end=mid-1;
            mid=(first+end)/2;
        }
        if (a[mid]==n)
        {
            count=1;
            break;
        }

    }
    if (count==1)
    {
        cout<<"Element Found at : "<<mid;
    }
    else
    {
        cout<<"Element not found";
    }


}

int main()
{
    int n=6;
    int a[n];
    int i;

    for ( i = 0; i < n; i++)
    {
        cin>>a[i];
    }


    cout<<"\n\nSorted Array is: ";
    for ( i = 0; i < n; i++)
    {
        cout<<a[i]<<" ";
    }

    binary_search(a,n,6);

}