About 9,530,000 results
Open links in new tab
  1. algorithm - Finding all possible combinations of numbers to reach …

    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 …

  2. jwt - RS256 vs HS256: What's the difference? - Stack Overflow

    Aug 31, 2016 · Both choices refer to what algorithm the identity provider uses to sign the JWT. Signing is a cryptographic operation that generates a "signature" (part of the JWT) that the …

  3. 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 …

  4. algorithm - Calculate distance between two latitude-longitude …

    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 …

  5. 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 …

  6. 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 …

  7. When should I use TCP_NODELAY and when TCP_CORK?

    Sep 21, 2010 · 39 TCP_NODELAY Used to disable Nagle's algorithm to improve TCP/IP networks and decrease the number of packets by waiting until an acknowledgment of previously sent …

  8. algorithm - Difference between Big-O and Little-O Notation - Stack …

    Sep 1, 2009 · Algorithm A can't tell the difference between two similar inputs instances where only x 's value changes. If x is the minimum in one of these instances and not in the other, then A will …

  9. A simple algorithm for polygon intersection - Stack Overflow

    Feb 16, 2010 · I'm looking for a very simple algorithm for computing the polygon intersection/clipping. That is, given polygons P, Q, I wish to find polygon T which is contained in …

  10. collision - Algorithm for Gift Card Codes - Stack Overflow

    Jan 18, 2010 · I recently posted this question about codes for a gift-card-like voucher that users can redeem online. I wanted to find the best tradeoff between large keyspace, low guessability, …