Skip to content
Navigation Menu
Sign in
Products
Platform
GitHub
Repository hosting, code review, and collaboration
Copilot
AI coding agent for tasks, projects, and automated work
Build & Ship
Actions
CI/CD and automation
Code Quality
Quality analysis, fixes, and enforcement
Codespaces
Cloud development environments
Secure
Code Security
Vulnerability detection and remediation
Secret Protection
Secret scanning and leak prevention
All Features
Developers
Learn
Documentation
Training
Certifications
Build
Build with Copilot
Customize Copilot
Integrations
Explore
Trending repos
GitHub Sponsors
Developer articles
Changelog
Changelog
Your source for the latest features, improvements, and fixes across GitHub products, all in one place.
Businesses
By Stage
Enterprises
Team
Startups
Nonprofits
By Industry
Healthcare
Financial services
Manufacturing
Government
See all industries
Evaluate GitHub
Why GitHub
Customer Stories
Business insights
Trust Center
Add-ons
GitHub Advanced Security
Enterprise-grade code security
Copilot for business
Enterprise-grade AI features
Premium Support
Enterprise-grade 24/7 support
Resources
Learn & Connect
Documentation
Resource center
Blog
Events & webinars
Community Forum
Customer Stories
Integrations
Support
Customer support
Training
GitHub Status
Company
About
Partners
Changelog
GitHub Universe
GitHub Universe
The event for developers, by developers — talks, workshops, and what’s next for GitHub.
Pricing
Search
/
Sign in
Sign up
Appearance settings
You signed in with another tab or window.
Reload
to refresh your session.
You signed out in another tab or window.
Reload
to refresh your session.
You switched accounts on another tab or window.
Reload
to refresh your session.
Dismiss alert
{{ message }}
bbeomgeun
Algorithm-cpp
Repository navigation
Code
Issues
Pull requests
Actions
Projects
Security and quality
Insights
More
items
Files
Expand file tree
master
Breadcrumbs
Algorithm-cpp
/
Sorting.cpp
Copy path
Blame
More file actions
Blame
More file actions
Latest commit
History
History
History
32 lines (28 loc) · 1 KB
master
Breadcrumbs
Algorithm-cpp
/
Sorting.cpp
Copy path
Top
File metadata and controls
Code
Blame
32 lines (28 loc) · 1 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
#include <iostream>
#include <algorithm>
using namespace std;
void callbyRef(int &arr1, int &arr2);
// 배열 sort연습 및 callbyRef 연습
// 오름차순 정렬은 처음과 나머지를 비교해서 최솟값 탐색 후 첫자리와 교환(1과 2,3,4,5) -> 그 다음 인덱스인 2와 3,4,5 비교후 2와 최솟값 교환
// 차곡차곡 최솟값이 앞에서부터 쌓이게 된다.
int main() {
const int length = 5;
int arr[length] = { 15,85,70,60,5 };
for (int whole = 0; whole < length - 1; whole++) { // 전체를 도는 인덱스
int small = whole; // 시작인덱스로 최솟값인덱스 초기화
for (int compare = whole + 1; compare < length; compare++) { //비교(compare index) 는 시작 인덱스 다음부터 돈다
if (arr[small] > arr[compare]) { //최솟값과 비교값
small = compare; //최솟값 업데이트
}
}
callbyRef(arr[small], arr[whole]); // 배열내에서 자리를 바꿔주자(처음과 최솟값을) -> 오름차순 정렬이 된다.
}
for (int i = 0; i < length; i++) { //배열 출력
cout << arr[i] << " , ";
}
}
void callbyRef(int &arr1, int &arr2) {
int temp = arr1;
arr1 = arr2;
arr2 = temp;
}
You can’t perform that action at this time.