Comparison of my own Insertion Sort versus the standard algorithm

I come from a background of making MVC websites and HTML5 applications, and have recently decided to dive into the sort of stuff i wasn’t taught at university, namely the things most people would learn on a computer science course.

Algorithmic problem – quickly finding all #’s where value %x is some given value

Problem I’m trying to solve, apologies in advance for the length:

How does a garbage collector prevent the whole memory from being scanned on every collect?

Some (at least Mono’s and .NET’s) garbage collectors have a short term memory area which they scan often, and a secondary memory area which they scan less often. Mono calls this a nursery.

How to create distinct set from other sets?

While solving the problems on Techgig.com, I got struck with one of the problems. The problem is like this:

Grading an algorithm: Readability vs. Compactness [closed]

Closed 9 years ago.

Efficient way to find unique elements in a vector compared against multiple vectors

I am trying find the number of unique elements in a vector compared against multiple vectors using C++. The vectors are in sorted order and it can be of size 2,000,000.

Figuring a max repetitive sub-tree in an object tree

I am trying to solve a problem of finding a max repetitive sub-tree in an object tree.

What is an appropriate language for expressing initial stages of algorithm refinement? [closed]

Closed 9 years ago.

Programmaticaly finding the Landau notation (Big O or Theta notation) of an algorithm?

I’m used to search for the Landau (Big O, Theta…) notation of my algorithms by hand to make sure they are as optimized as they can be, but when the functions are getting really big and complex, it’s taking way too much time to do it by hand. it’s also prone to human errors.

How Facebook’s Ad Bid System Works

When you are creating an ad on Facebook, you are provided with a “suggested bid” range (e.g., $0.90 – $2.15 USD). According to this page: