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

formatting source-code for 153fb7b8a5

Browse Source
This commit is contained in:
github-actions
2020-05-30 04:02:09 +00:00
parent 92fe9495ec
commit 8a2de9842b
175 changed files with 1671 additions and 3460 deletions
Download Patch File Download Diff File Expand all files Collapse all files

61
sorting/cocktail_selection_sort.cpp
View File

@@ -9,35 +9,27 @@
// Iterative Version
void CocktailSelectionSort(std::vector<int> *vec, int low, int high)
{
while (low <= high)
{
void CocktailSelectionSort(std::vector<int> *vec, int low, int high) {
while (low <= high) {
int minimum = (*vec)[low];
int minimumindex = low;
int maximum = (*vec)[high];
int maximumindex = high;
for (int i = low; i <= high; i++)
{
if ((*vec)[i] >= maximum)
{
for (int i = low; i <= high; i++) {
if ((*vec)[i] >= maximum) {
maximum = (*vec)[i];
maximumindex = i;
}
if ((*vec)[i] <= minimum)
{
if ((*vec)[i] <= minimum) {
minimum = (*vec)[i];
minimumindex = i;
}
}
if (low != maximumindex || high != minimumindex)
{
if (low != maximumindex || high != minimumindex) {
std::swap((*vec)[low], (*vec)[minimumindex]);
std::swap((*vec)[high], (*vec)[maximumindex]);
}
else
{
} else {
std::swap((*vec)[low], (*vec)[high]);
}
@@ -48,8 +40,7 @@ void CocktailSelectionSort(std::vector<int> *vec, int low, int high)
// Recursive Version
void CocktailSelectionSort_v2(std::vector<int> *vec, int low, int high)
{
void CocktailSelectionSort_v2(std::vector<int> *vec, int low, int high) {
if (low >= high)
return;
@@ -58,26 +49,20 @@ void CocktailSelectionSort_v2(std::vector<int> *vec, int low, int high)
int maximum = (*vec)[high];
int maximumindex = high;
for (int i = low; i <= high; i++)
{
if ((*vec)[i] >= maximum)
{
for (int i = low; i <= high; i++) {
if ((*vec)[i] >= maximum) {
maximum = (*vec)[i];
maximumindex = i;
}
if ((*vec)[i] <= minimum)
{
if ((*vec)[i] <= minimum) {
minimum = (*vec)[i];
minimumindex = i;
}
}
if (low != maximumindex || high != minimumindex)
{
if (low != maximumindex || high != minimumindex) {
std::swap((*vec)[low], (*vec)[minimumindex]);
std::swap((*vec)[high], (*vec)[maximumindex]);
}
else
{
} else {
std::swap((*vec)[low], (*vec)[high]);
}
@@ -86,15 +71,13 @@ void CocktailSelectionSort_v2(std::vector<int> *vec, int low, int high)
// main function, select any one of iterative or recursive version
int main()
{
int main() {
int n;
std::cout << "Enter number of elements\n";
std::cin >> n;
std::vector<int> v(n);
std::cout << "Enter all the elements\n";
for (int i = 0; i < n; ++i)
{
for (int i = 0; i < n; ++i) {
std::cin >> v[i];
}
@@ -102,22 +85,16 @@ int main()
std::cout << "Enter method: \n\t0: iterative\n\t1: recursive:\t";
std::cin >> method;
if (method == 0)
{
if (method == 0) {
CocktailSelectionSort(&v, 0, n - 1);
}
else if (method == 1)
{
} else if (method == 1) {
CocktailSelectionSort_v2(&v, 0, n - 1);
}
else
{
} else {
std::cerr << "Unknown method" << std::endl;
return -1;
}
std::cout << "Sorted elements are\n";
for (int i = 0; i < n; ++i)
{
for (int i = 0; i < n; ++i) {
std::cout << v[i] << " ";
}