https://www.acmicpc.net/problem/23235
23235번: The Fastest Sorting Algorithm In The World
It is common to compare sorting algorithms based on their asymptotic speeds. Some slower algorithms like selection sort take O(N2) time to sort N items, while comparison-based sorts like merge sort can go no faster than O(N log(N)) time, under reasonable a
www.acmicpc.net
|
1
2
3
4
5
6
7
8
9
|
if __name__ == '__main__':
cnt = 1
while True:
s =input()
if s =='0':
break
else:
print("Case %d: Sorting... done!"%(cnt))
cnt+=1
|
cs |
반복문을 통한 단순 출력입니다.
Just use Loop, Print.
That's all
반응형
'python-algorithm' 카테고리의 다른 글
| 백준 7595 Triangles (0) | 2022.11.15 |
|---|---|
| 백준 16099 Larger Sport Facility (0) | 2022.11.15 |
| 백준 25311 UCPC에서 가장 쉬운 문제 번호는? (0) | 2022.11.15 |
| 백준 12833 XORXORXOR (0) | 2022.11.14 |
| 백준 15947 아기 석환 뚜루루 뚜루 (0) | 2022.11.14 |
댓글