Skip to content

고동욱 (2021-19470) #46

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
KhoDongwook wants to merge 2 commits into
base: master
Choose a base branch
from
Open

고동욱 (2021-19470) #46

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
d86d72e
edit
KhoDongwook Mar 31, 2022
9de7494
edit2
KhoDongwook Mar 31, 2022
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
37 changes: 29 additions & 8 deletions main.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -141,7 +141,13 @@ void bubble_sort_descending(int* array, unsigned int size) {
for (unsigned int i = 0; i < size - 1; i++)
{
//#######################################################
//Implement here
for (unsigned int j=0; j<size -i -1; j++)
{
if(array[j]<array[j+1])
{
swap(array[j], array[j+1]);
}
}
;
//#######################################################
}
Expand All @@ -150,9 +156,17 @@ void bubble_sort_descending(int* array, unsigned int size) {
void insertion_sort_descending(int* array, unsigned int size) {
for (unsigned int i = 1; i < size; i++)
{
//#######################################################
//Implement here
;
//#######################################################
int j=i-1;
int target = array[i];
while (1){
if(j<0){break;}
if(target<=array[j]){break;}
array[j+1]=array[j];
j--;
}
array[j+1]=target;

//#######################################################
}
}
Expand All @@ -161,11 +175,18 @@ void selection_sort_descending(int* array, unsigned int size) {
for (unsigned int i = 0; i < size - 1; i++)
{
//#######################################################
//Implement here
;
//#######################################################
int max_index = i;
int max_val = array[i];
for (unsigned int j=i+1; j<size; j++)
{
if(array[j]>max_val){
max_index = j;
max_val = array[j];
}
}
swap(array[i], array[max_index]);
//######################################################
}
}