Skip to content
#

Algorithm

Algorithms are detailed sets of guidelines created for a computer program to complete tasks efficiently and thoroughly.

Here are 8,300 public repositories matching this topic...

javascript-algorithms
leetcode
azl397985856
azl397985856 commented Mar 24, 2020

集合 S 包含从1到 n 的整数。不幸的是,因为数据错误,导致集合里面某一个元素复制了成了集合里面的另外一个元素的值,导致集合丢失了一个整数并且有一个元素重复。

给定一个数组 nums 代表了集合 S 发生错误后的结果。你的任务是首先寻找到重复出现的整数,再找到丢失的整数,将它们以数组的形式返回。

示例 1:

输入: nums = [1,2,2,4]
输出: [2,3]
注意:

给定数组的长度范围是 [2, 10000]。
给定的数组是无序的。

来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/set-mismatch

wnesensohn
wnesensohn commented May 23, 2016

Selection Sort, for example, makes the algorithm look extremely (impossibly) good at first glance - O(n) - because it's not showing the majority of the steps.

Instead of

    for (var j = i + 1; j < D.length; j++) {
        if (D[j] < D[minJ]) {
            tracer._select(j);
            minJ = j;
            tracer._deselect(j);
        }
    }

it has to be more like

    for (var j
TheSuperNoob
TheSuperNoob commented Mar 2, 2020

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

homemade-machine-learning
alqbib
alqbib commented Mar 31, 2019

Vectorized version of gradient descent.

theta = theta * reg_param - alpha * (1 / num_examples) * (delta.T @ self.data).T

We should NOT regularize the parameter theta_zero.

theta[0] = theta[0] - alpha * (1 / num_examples) * (self.data[:, 0].T @ delta).T

the first code line ,theta include theta[0].
so I think can write like this:
theta[0] -= alpha * (1 / num_examples) * (self.data[:, 0].

📚 C/C++ 技术面试基础知识总结,包括语言、程序库、数据结构、算法、系统、网络、链接装载库等知识及面试经验、招聘、内推等信息。This repository is a summary of the basic knowledge of recruiting job seekers and beginners in the direction of C/C++ technology, including language, program library, data structure, algorithm, system, network, link loading library, interview experience, recruitment, recommendation, etc.

  • Updated Apr 19, 2020
  • C++
c1887
c1887 commented Feb 20, 2020

Chapter number or note title: Chapter 0, Exercise 2, Footnote 24

Page number: 17

Error description: The footnote says "Ja, das ist das [...]maschine". However, the German language has 3 different articles (der, die das). In this particular case, you want "die" instead of "das" [...]maschine.

Suggested fix (if any):
Ja, das ist die Subatomar[...]maschine.

BitYog
BitYog commented Nov 30, 2017

Hey @mgechev,
I noticed that you have a README.md file in src/sorting, which has the Big O complexity for all algorithms. It also has the "When to use" column, which is blank. Basecs already has many algorithms' explanations, and can be used to fill in this.column. The explanations are valid for most languages and are concise.

Also, a README.md for all src/* folders would be helpful. (I would

auphofBSF
auphofBSF commented Aug 21, 2019

A more consistent and multi-functional global level of verbosity control,
suggest an enhancement that will see print(...) in project be converted to using the python logging. module

import logging
#Then instead of print() use either
logging.info(......)
#or
logging.debug(.....)
#or
logging.warning(....)
#or
#logging.error()

In that way verbosity can be globally

Wikipedia
Wikipedia
You can’t perform that action at this time.