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 }}
o-ozogie
algorithm
Repository navigation
Code
Issues
Pull requests
Actions
Projects
Security and quality
Insights
More
items
Files
Expand file tree
algorithm
Breadcrumbs
algorithm
/
sort
/
quick_sort.rb
Copy path
Blame
More file actions
Blame
More file actions
Latest commit
History
History
History
35 lines (29 loc) · 1.07 KB
algorithm
Breadcrumbs
algorithm
/
sort
/
quick_sort.rb
Copy path
Top
File metadata and controls
Code
Blame
35 lines (29 loc) · 1.07 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
33
34
35
def
partition
(
arr
,
first
,
last
)
count
=
first
i
=
first
# 배열을 first부터 last까지 순회한다.
while
i
<
last
# 순회하는 중 기준값(여기서는 last)보다 작은 값을 발견할 경우 count의 값과 교환한다.
# 이후 count를 +1 하여 기준값보다 작은 값들을 count index 뒤로 미루어 둔다.
if
arr
[
i
]
<
arr
[
last
]
arr
[
i
]
,
arr
[
count
]
=
arr
[
count
]
,
arr
[
i
]
count
+=
1
end
i
+=
1
end
# 순회가 모두 끝난 뒤, count index의 값(기준값보다 큰 값과 작은 값을 나누는 경계)과 기준 값을 교환한다.
# 그리고 기준값의 인덱스를 반환한다.
arr
[
last
]
,
arr
[
count
]
=
arr
[
count
]
,
arr
[
last
]
count
end
def
quick_sort
(
arr
,
first
,
last
)
if
first
<
last
# partition 함수에서 반환된 기준값을 가지고 기준값을 제외한 기준값의 왼쪽, 오른쪽을 다시 정렬한다.
pivot
=
partition
(
arr
,
first
,
last
)
quick_sort
(
arr
,
first
,
pivot
-
1
)
quick_sort
(
arr
,
pivot
+
1
,
last
)
end
arr
end
arr
=
[
8
,
13
,
1
,
6
,
1
,
4
]
p
quick_sort
(
arr
,
0
,
5
)
You can’t perform that action at this time.