-
Right now, the selection is purely `random`, per the implementation of https://hubot.github.com/docs/scripting/#random This thus leads to the potential selection of sub-par posts. Instead, we should g…
-
Add Selection sort algorithm in `Sort` folder. Please create a separate directory for the language you are using.
exp: `Sort/Python/selectionsort.py`
-
We can start by:
- [x] porting from [sklearn](http://scikit-learn.org/stable/modules/feature_selection.html)
- [ ] adding a few from [this resource](http://featureselection.asu.edu/algorithms.php) (es…
-
Something like a human player (well, how I...) plays.
Try to pack in a corner, minimising holes left and minimising any long empty gaps.
-
# Merge sort. selection sort ,bubble sort
Merge Sort is a Divide and Conquer algorithm that divides an array into two halves, recursively sorts both halves, and then merges the sorted halves to pr…
-
The proposer selection algorithm is like below.
https://github.com/bosnet/sebak/wiki/How-to-select-the-proposer
``` go
func CalculateProposer(blockHeight int, roundNumber int) string {
candidates…
-
Current approach suggests to test all possible constraint combinations and use the combination that has the lowest fitness distance.
This is difficult to implement and provides sometimes interesting …
-
**This is a(n):**
- [x] New algorithm
- [ ] Update to an existing algorithm
- [ ] Error
- [x] Proposal to the Repository
**Details:**
I am improving the Java section of my repository by addi…
-
The current `CoinSelector` class only implements the Lowest Larger coin selection algorithm. The goal is to implement Branch and Bound coin selection and Single Random Draw selection, then use a waste…
-
I would like to contribute to this project under Hacktoberfest by adding various sorting algorithms in C++. These include:
- Bubble Sort
- Selection Sort
- Insertion Sort
- Merge Sort
- Quick Sor…