Skip to content
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.

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

Algorithm: Sorting/SelectionSort #91

Closed
3 tasks
Tracked by #68
wildanie12 opened this issue Oct 24, 2021 · 0 comments · Fixed by #136
Closed
3 tasks
Tracked by #68

Algorithm: Sorting/SelectionSort #91

wildanie12 opened this issue Oct 24, 2021 · 0 comments · Fixed by #136
Labels
algorithm documentation Improvements or additions to documentation

Comments

@wildanie12
Copy link
Member

wildanie12 commented Oct 24, 2021

Selection Sort, algoritma pengurutan data yang sangat sederhana yang cara kerjanya adalah dengan melakukan iterasi di setiap index deretan berkali-kali dan melakukan pengkondisian untuk mencari nilai terkecil/terbesar agar dapat di tempatkan pada tempat elemen yang sudah diurutkan.

Kamu dapat menempatkan pada folder algorithms/Sorting/SelectionSort
didalam direktori tersebut, struktur direktori harus berbentuk sebagai berikut:

Search
├ SelectionSort
│  ├ SelectionSort.php
│  └ README.md
└ README.md  

Jangan lupa untuk membuat Unit testingnya juga pada direktori tests/
Selengkapnya tentang pedoman kontribusi bisa dibaca di CONTRIBUTING.md

Progress Checklist

  • Implementasi kode
  • Artikel penjelasan Readme
  • Unit Testing
@wildanie12 wildanie12 added documentation Improvements or additions to documentation algorithm labels Oct 24, 2021
@wildanie12 wildanie12 changed the title Algorithm: Sorting/Selection Sort Algorithm: Sorting/SelectionSort Oct 24, 2021
@wildanie12 wildanie12 mentioned this issue Oct 24, 2021
11 tasks
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
algorithm documentation Improvements or additions to documentation
Projects
None yet
Development

Successfully merging a pull request may close this issue.

1 participant