About 9,530,000 results
Open links in new tab
  1. What is the difference between a heuristic and an algorithm?

    Feb 25, 2010 · An algorithm is the description of an automated solution to a problem. What the algorithm does is precisely defined. The solution could or could not be the best possible one but you know from …

  2. how do *you* calculate/approximate Big O? - Stack Overflow

    Most people with a degree in CS know what Big O stands for. It helps us to measure how well an algorithm scales. How do you calculate or approximate the complexity of your algorithms?

  3. algorithm - Finding all possible combinations of numbers to reach a ...

    Jan 8, 2011 · 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 numbers to add: N = …

  4. c - Fast CRC algorithm? - Stack Overflow

    CRC32 algorithm is exactly what I'm looking for, but I can't use it because the table it requires is way too huge (it is for an embedded system where resources are VERY rare). So: any suggestions for a fast …

  5. Is there an efficient algorithm to generate a 2D concave hull?

    The answer may still be interesting for somebody else: One may apply a variation of the marching square algorithm, applied (1) within the concave hull, and (2) then on (e.g. 3) different scales that my …

  6. algorithm - What is the difference between depth and height in a tree ...

    Dec 1, 2023 · 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 path between …

  7. algorithm - Calculate distance between two latitude-longitude points ...

    Aug 26, 2008 · How do I calculate the distance between two points specified by latitude and longitude? For clarification, I'd like the distance in kilometers; the points use the WGS84 system and I'd like to …

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

    Feb 22, 2010 · 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 problem into half and do …

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

    Jul 2, 2009 · 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 along the …

  10. Finding the median of an unsorted array - Stack Overflow

    May 19, 2012 · There is still no linear algorithm in existence AFAIK for finding the median of an arbitrary, unsorted dataset. Think about it - a dataset that contains values 1..25 has true median 13. If one of …