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

cpplint and msvc fixes for - sorting

Browse Source
This commit is contained in:
Krishna Vedala
2020-05-26 12:15:12 -04:00
parent 76a5f572d5
commit 0d8e015d15
3 changed files with 28 additions and 28 deletions
Download Patch File Download Diff File Expand all files Collapse all files

44
sorting/cocktail_selection_sort.cpp
View File

@@ -9,28 +9,28 @@
// Iterative Version
void CocktailSelectionSort(std::vector<int> &vec, int low, int high) {
void CocktailSelectionSort(std::vector<int> *vec, int low, int high) {
while (low <= high) {
int minimum = vec[low];
int minimum = (*vec)[low];
int minimumindex = low;
int maximum = vec[high];
int maximum = (*vec)[high];
int maximumindex = high;
for (int i = low; i <= high; i++) {
if (vec[i] >= maximum) {
maximum = vec[i];
if ((*vec)[i] >= maximum) {
maximum = (*vec)[i];
maximumindex = i;
}
if (vec[i] <= minimum) {
minimum = vec[i];
if ((*vec)[i] <= minimum) {
minimum = (*vec)[i];
minimumindex = i;
}
}
if (low != maximumindex || high != minimumindex) {
std::swap(vec[low], vec[minimumindex]);
std::swap(vec[high], vec[maximumindex]);
std::swap((*vec)[low], (*vec)[minimumindex]);
std::swap((*vec)[high], (*vec)[maximumindex]);
} else {
std::swap(vec[low], vec[high]);
std::swap((*vec)[low], (*vec)[high]);
}
low++;
@@ -40,29 +40,29 @@ 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;
int minimum = vec[low];
int minimum = (*vec)[low];
int minimumindex = low;
int maximum = vec[high];
int maximum = (*vec)[high];
int maximumindex = high;
for (int i = low; i <= high; i++) {
if (vec[i] >= maximum) {
maximum = vec[i];
if ((*vec)[i] >= maximum) {
maximum = (*vec)[i];
maximumindex = i;
}
if (vec[i] <= minimum) {
minimum = vec[i];
if ((*vec)[i] <= minimum) {
minimum = (*vec)[i];
minimumindex = i;
}
}
if (low != maximumindex || high != minimumindex) {
std::swap(vec[low], vec[minimumindex]);
std::swap(vec[high], vec[maximumindex]);
std::swap((*vec)[low], (*vec)[minimumindex]);
std::swap((*vec)[high], (*vec)[maximumindex]);
} else {
std::swap(vec[low], vec[high]);
std::swap((*vec)[low], (*vec)[high]);
}
CocktailSelectionSort(vec, low + 1, high - 1);
@@ -85,9 +85,9 @@ int main() {
std::cin >> method;
if (method == 0) {
CocktailSelectionSort(v, 0, n - 1);
CocktailSelectionSort(&v, 0, n - 1);
} else if (method == 1) {
CocktailSelectionSort_v2(v, 0, n - 1);
CocktailSelectionSort_v2(&v, 0, n - 1);
} else {
std::cerr << "Unknown method" << std::endl;
return -1;