Skip to content

sort: introduce selection sort #54

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

Merged
mertcandav merged 1 commit into from
May 27, 2026
Merged

sort: introduce selection sort #54

Show file tree
Hide file tree
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
16 changes: 16 additions & 0 deletions sort/selection.jule
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,16 @@
fn Selection[T: ordered](mut arr: []T): []T {
mut i := 0
for i < len(arr); i++ {
mut minIdx := i
mut j := i + 1
for j < len(arr); j++ {
if arr[j] < arr[minIdx] {
minIdx = j
}
}
if minIdx != i {
arr[i], arr[minIdx] = arr[minIdx], arr[i]
}
}
return arr
}
5 changes: 5 additions & 0 deletions sort/testcases_test.jule
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -140,6 +140,11 @@ fn testShell(t: &testing::T) {
testGeneral(t, Shell[int])
}

#test
fn testSelection(t: &testing::T) {
testGeneral(t, Selection[int])
}

#test
fn testQuicksort(t: &testing::T) {
testGeneral(t, Quicksort[int])
Expand Down
Loading