Skip to content

김민수(2021-10288) #60

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
Chaehwasu wants to merge 1 commit into
base: master
Choose a base branch
from
Open

김민수(2021-10288) #60

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
30 changes: 27 additions & 3 deletions main.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -140,6 +140,14 @@ void swap(int& a, int& b) {
void bubble_sort_descending(int* array, unsigned int size) {
for (unsigned int i = 0; i < size - 1; i++)
{
for(unsigned int j = 0; j < size - 1-i; j++){
if (array[j]<array[j+1]){
int temp;
temp=array[j];
array[j]=array[j+1];
array[j+1]=temp;
}
}
//#######################################################
//Implement here
;
Expand All @@ -150,8 +158,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++)
{
int temp=array[i];
int j=i-1;
while(1){
if (j<0) break;
if(array[j]>=temp) break;
array[j+1]=array[j];
j--;
}
//#######################################################
//Implement here
array[j+1]=temp;
;
//#######################################################
}
Expand All @@ -161,11 +178,18 @@ void selection_sort_descending(int* array, unsigned int size) {
for (unsigned int i = 0; i < size - 1; i++)
{
//#######################################################
int min = array[i];
int min_index=i;
for (unsigned int j=i+1; j<size; j=j+1){
if (array[j]>min){
min=array[j];
min_index=j;
}
}
swap(array[i],array[min_index]);
//Implement here
;

//#######################################################
}
}