backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-04-04 19:20:17 +08:00
Code Issues Projects Releases Wiki Activity

style: format code

Browse Source
This commit is contained in:
yanglbme
2019-08-21 10:10:08 +08:00
parent abc0d365de
commit 69ddc9fc52
101 changed files with 3154 additions and 2984 deletions
Download Patch File Download Diff File Expand all files Collapse all files

157
Data Structure/List Array.cpp
View File

@@ -1,32 +1,32 @@
#include<iostream>
#include <iostream>
using namespace std;
struct list
{
int data[50];
int top=0;
bool isSorted=false;
int top = 0;
bool isSorted = false;
int BinarySearch(int *array, int first, int last, int x)
{
if(last<first)
if (last < first)
{
return -1;
}
int mid=(first+last)/2;
if(array[mid]==x)
int mid = (first + last) / 2;
if (array[mid] == x)
return mid;
else if(x<array[mid])
return (BinarySearch(array, first, mid-1, x));
else if(x>array[mid])
return (BinarySearch(array, mid+1, last, x));
else if (x < array[mid])
return (BinarySearch(array, first, mid - 1, x));
else if (x > array[mid])
return (BinarySearch(array, mid + 1, last, x));
}
int LinarSearch(int *array, int x)
{
for (int i = 0; i < top; i++)
{
if (array[i]==x)
if (array[i] == x)
{
return i;
}
@@ -37,102 +37,101 @@ struct list
int Search(int x)
{
int pos=-1;
int pos = -1;
if (isSorted)
{
pos=BinarySearch(data, 0, top-1, x);
pos = BinarySearch(data, 0, top - 1, x);
}
else
{
pos=LinarSearch(data, x);
pos = LinarSearch(data, x);
}
if (pos!=-1)
if (pos != -1)
{
cout<<"\nElement found at position : "<<pos;
cout << "\nElement found at position : " << pos;
}
else
{
cout<<"\nElement not found";
cout << "\nElement not found";
}
return pos;
}
void Sort()
{
int i, j, pos;
for(i=0; i<top; i++)
for (i = 0; i < top; i++)
{
int min=data[i];
for(j=i+1; j<top; j++)
int min = data[i];
for (j = i + 1; j < top; j++)
{
if(data[j]<min)
if (data[j] < min)
{
pos=j;
min=data[pos];
pos = j;
min = data[pos];
}
}
int temp=data[i];
data[i]=data[pos];
data[pos]=temp;
int temp = data[i];
data[i] = data[pos];
data[pos] = temp;
}
isSorted=true;
isSorted = true;
}
void insert(int x)
{
if(!isSorted)
if (!isSorted)
{
if(top==49)
if (top == 49)
{
cout<<"\nOverflow";
cout << "\nOverflow";
}
else
{
data[top]=x;
data[top] = x;
top++;
}
}
else
{
int pos=0;
for (int i = 0; i < top-1; i++)
int pos = 0;
for (int i = 0; i < top - 1; i++)
{
if(data[i]<=x && x<=data[i+1])
if (data[i] <= x && x <= data[i + 1])
{
pos=i+1;
pos = i + 1;
break;
}
}
if (pos==0)
if (pos == 0)
{
pos=top-1;
pos = top - 1;
}
for (int i = top; i > pos; i--)
{
data[i]=data[i-1];
data[i] = data[i - 1];
}
top++;
data[pos]=x;
data[pos] = x;
}
}
void Remove(int x)
{
int pos=Search(x);
cout<<"\n"<<data[pos]<<" deleted";
int pos = Search(x);
cout << "\n"
<< data[pos] << " deleted";
for (int i = pos; i < top; i++)
{
data[i]=data[i+1];
data[i] = data[i + 1];
}
top--;
}
@@ -141,7 +140,7 @@ struct list
{
for (int i = 0; i < top; i++)
{
cout<<data[i]<<"\t";
cout << data[i] << "\t";
}
}
};
@@ -152,34 +151,38 @@ int main()
int choice;
int x;
do
{
cout<<"\n1.Insert";
cout<<"\n2.Delete";
cout<<"\n3.Search";
cout<<"\n4.Sort";
cout<<"\n5.Print";
cout<<"\n\nEnter Your Choice : ";
cin>>choice;
{
cout << "\n1.Insert";
cout << "\n2.Delete";
cout << "\n3.Search";
cout << "\n4.Sort";
cout << "\n5.Print";
cout << "\n\nEnter Your Choice : ";
cin >> choice;
switch (choice)
{
case 1: cout<<"\nEnter the element to be inserted : ";
cin>>x;
L.insert(x);
break;
case 2: cout<<"\nEnter the element to be removed : ";
cin>>x;
L.Remove(x);
break;
case 3: cout<<"\nEnter the element to be searched : ";
cin>>x;
L.Search(x);
break;
case 4: L.Sort();
break;
case 5: L.Show();
break;
case 1:
cout << "\nEnter the element to be inserted : ";
cin >> x;
L.insert(x);
break;
case 2:
cout << "\nEnter the element to be removed : ";
cin >> x;
L.Remove(x);
break;
case 3:
cout << "\nEnter the element to be searched : ";
cin >> x;
L.Search(x);
break;
case 4:
L.Sort();
break;
case 5:
L.Show();
break;
}
}
while(choice!=0);
} while (choice != 0);
return 0;
}