约 50 个结果
在新选项卡中打开链接
  1. algorithm - Finding all possible combinations of numbers to reach …

    2011年1月8日 · How would you go about testing all possible combinations of additions from a given set N of numbers so they add up to a given final number? A brief example: Set of …

  2. algorithm - What does O (log n) mean exactly? - Stack Overflow

    2010年2月22日 · A common algorithm with O (log n) time complexity is Binary Search whose recursive relation is T (n/2) + O (1) i.e. at every subsequent level of the tree you divide …

  3. algorithm - What is the difference between depth and height in a …

    2023年12月1日 · This is a simple question from algorithms theory. The difference between them is that in one case you count number of nodes and in other number of edges on the shortest …

  4. Circle line-segment collision detection algorithm? - Stack Overflow

    2009年7月2日 · I have a line from A to B and a circle positioned at C with the radius R. What is a good algorithm to use to check whether the line intersects the circle? And at what coordinate …

  5. What is Sliding Window Algorithm? Examples? - Stack Overflow

    2011年11月25日 · While solving a geometry problem, I came across an approach called Sliding Window Algorithm. Couldn't really find any study material/details on it. What is the algorithm …

  6. Algorithm to compare two images - Stack Overflow

    2015年4月18日 · Why could this be useful? Dependant on the morphing algorithm you use, there may be a relationship between similarity of images, and some parameters of the morphing …

  7. matrix multiplication algorithm time complexity - Stack Overflow

    2017年1月22日 · I came up with this algorithm for matrix multiplication. I read somewhere that matrix multiplication has a time complexity of o(n^2). But I think my this algorithm will give …

  8. Newest 'algorithm' Questions - Stack Overflow

    An algorithm is a sequence of well-defined steps that defines an abstract solution to a problem. Sign up to watch this tag and see more personalized content

  9. Why doesn't Dijkstra's algorithm work for negative weight edges?

    2012年10月31日 · Can somebody tell me why Dijkstra's algorithm for single source shortest path assumes that the edges must be non-negative. I am talking about only edges not the negative …

  10. algorithm - Peak signal detection in realtime timeseries data

    Robust peak detection algorithm (using z-scores) I came up with an algorithm that works very well for these types of datasets. It is based on the principle of dispersion: if a new datapoint is a …