-
Updated
Jul 12, 2020
algorithms
Algorithms are detailed sets of guidelines created for a computer program to complete tasks efficiently and thoroughly.
Here are 11,587 public repositories matching this topic...
-
Updated
Jul 16, 2020 - Java
-
Updated
Jul 15, 2020
- We have BFS and DFS images in both Breadth First Traversal and Depth First Traversal. We should have illustrations in the respective sections.
-
Updated
Jul 7, 2020 - JavaScript
Contributing.md is dead.
I wanna contribute to this project.
If you are ok, I would like to update the Contributing.md with reference to your project "python".
If not, I want you to fix it.
-
Updated
Jul 9, 2020 - Swift
Is there a reason why in travis CI config the command black --check . || true
is run? I don't see the point in checking if files needs to be reformatted if it's just going to be ignored anyways.
Currently running black --line-length 127 --check .
-> 399 files would be reformatted, 74 files would be left unchanged.
In additio
-
Updated
May 3, 2020
-
Updated
Jul 15, 2020
-
Updated
Jul 16, 2020 - C++
-
Updated
Jul 8, 2020 - Java
-
Updated
Jul 1, 2020 - Python
There are 2 places we are using BufferBlock<T>
today:
We should consider replacing this depende
-
Updated
Jun 17, 2020 - Java
-
Updated
Apr 21, 2020 - Python
-
Updated
Jun 15, 2020 - C#
add git 使用指南
首先,十分欢迎你来给 OI WIki 开 issue,在提交之前,请花时间阅读一下这个模板的内容,谢谢合作!
- 希望添加的是什么?
git 使用指南
- 英文叫什么?
git-guidebook
- 有什么参考资料?
https://git-scm.com/docs
https://git-scm.com/book/zh/v2
issue 标题请写为 'add ' + 要添加的内容
然后可以在 htc 里 link 一下。(我刚开始写 Wiki 的时候就不知道怎么做到“一个 pr 只干一件事”)
-
Updated
Jul 10, 2020 - JavaScript
Add quickselect algorithm. Quickselect is a selection algorithm to find the kth smallest element in an unordered list.
I create leetcode directory. You can contribute solution for Leetcode algorithm by C language.
Good practice coding :)
Please put some comment for explanation. It helps other people understand your algorithm better
-
Updated
Jul 12, 2019 - Jupyter Notebook
-
Updated
Jun 23, 2020 - Python
-
Updated
Jun 30, 2020 - C#
-
Updated
Feb 8, 2020
-
Updated
Jul 8, 2020
golangci-lint run --no-config searches
##[error]searches/binary_search.go:20:6: `iterBinarySearch` is unused (deadcode)
func iterBinarySearch(array []int, target int, lowIndex int, highIndex int) int {
^
##[error]searches/binary_search.go:6:6: func `binarySearch` is unused (unused)
func binarySearch(array []int, target int, lowIndex int, highIndex int) int {
^
-
Updated
Apr 18, 2020 - Java
- Wikipedia
- Wikipedia
https://github.com/trekhleb/javascript-algorithms/blob/master/src/algorithms/sets/cartesian-product/cartesianProduct.js#L8
I think it makes more sense to return an empty array