728x90
반응형
![](https://blog.kakaocdn.net/dn/YVGrw/btrVe47vaoL/RvkqmgGDCnjRJ4IlMx5tvk/img.png)
![](https://blog.kakaocdn.net/dn/uXzBr/btrVfj4skfZ/XLNfliYt0aKzjnTLVyDBw0/img.png)
![](https://blog.kakaocdn.net/dn/bmqE6u/btrU6ZfnicX/M4wFBXeWa62t6yUf718f40/img.png)
![](https://blog.kakaocdn.net/dn/daQW71/btrVf8hhTGF/0e2YK0pUOvEEhhRlvfNlQK/img.png)
![](https://blog.kakaocdn.net/dn/Lzsx7/btrVfiR2mJd/bTvZSSTMyOGo6JDeo0dkDk/img.png)
![](https://blog.kakaocdn.net/dn/LtI2e/btrVfs1lXAG/ZZkRIrVLoM0NxKRI1aP4i0/img.png)
![](https://blog.kakaocdn.net/dn/cuJJDN/btrVeUX9DLq/PFk1dGiakx84BbpBasdqw0/img.png)
![](https://blog.kakaocdn.net/dn/n48hB/btrVewQJMzh/pERuOyTQLJ5vpsoEEBUTs0/img.png)
#include <bits/stdc++.h>
using namespace std;
int n = 10;
int target[10] = {7, 5, 9, 0, 3, 1, 6, 2, 4, 8};
int main() {
ios::sync_with_stdio(0);
cin.tie(0); //속도 가속화
for(int i=1; i<n; i++){
for(int j=i; j>0; j--){
if(target[j] < target[j-1]){
swap(target[j], target[j-1]);
}
else break;
}
}
for(int i=0; i<n; i++){
cout << target[i] << ' ';
}
return 0;
}
728x90
반응형
'알고리즘' 카테고리의 다른 글
[백준/퀵소트/C++] 11728번 배열 합치기 (0) | 2023.01.04 |
---|---|
[이코테/계수정렬/C++] 계수정렬 (0) | 2023.01.03 |
[이코테/정렬/C++] 선택 정렬 (0) | 2023.01.03 |
[백준/이분탐색/C++] 10816번 숫자 카드 2 (upper_bound, lower_bound 사용) (0) | 2023.01.03 |
[백준/이분탐색/C++] 10815번 숫자 카드 (0) | 2023.01.03 |