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
This file should be edited (I tried, but I dont think you can edit wikis on forks)
current
proposed
and requires modifying the markdown to this:
<h2>Selection sort</h2>
**selection sort**, algorithm sorts an array by repeatedly finding the minimum element (considering ascending order) from the unsorted part and putting it at the beginning. The algorithm maintains two subarrays in a given array.
<ol>
<li> The subarray which is already sorted.</li>
<li> Remaining subarray which is unsorted.</li>
In every iteration of selection sort, the minimum element (considering ascending order) from the unsorted subarray is picked and moved to the sorted subarray.
#### Properties:- Worst-case performance O(n^2)
- Best-case performance O(n)
- Average case performance O(n^2)
**read more at: [Wikipedia](https://en.wikipedia.org/wiki/Selection_sort)**<br>
**code: [Selection sort](https://github.com/TheAlgorithms/Python/blob/master/sorts/selection_sort.py)*****
Note: edit required to bold text and link to code. example ref
Additional information
No response
The text was updated successfully, but these errors were encountered:
What would you like to share?
This file should be edited (I tried, but I dont think you can edit wikis on forks)
current
proposed
and requires modifying the markdown to this:
Note: edit required to bold text and link to code. example ref
Additional information
No response
The text was updated successfully, but these errors were encountered: