Skip to content
  • Categories
  • Recent
  • Tags
  • Popular
  • World
  • Users
  • Groups
Skins
  • Light
  • Cerulean
  • Cosmo
  • Flatly
  • Journal
  • Litera
  • Lumen
  • Lux
  • Materia
  • Minty
  • Morph
  • Pulse
  • Sandstone
  • Simplex
  • Sketchy
  • Spacelab
  • United
  • Yeti
  • Zephyr
  • Dark
  • Cyborg
  • Darkly
  • Quartz
  • Slate
  • Solar
  • Superhero
  • Vapor

  • Default (No Skin)
  • No Skin
Collapse
Code Project
N

novice__geek

@novice__geek
About
Posts
4
Topics
0
Shares
0
Groups
0
Followers
0
Following
0

Posts

Recent Best Controversial

  • What is your best code comment this year?
    N novice__geek

    //Write comment for the method below I usually feel very lazy to write comments (I know its a bad practice)... I wrote the above once for a C# application I was writing.

    The Lounge question database

  • Fast Image Processing - programming language to use
    N novice__geek

    why isn't talking about matlab?

    Algorithms csharp c++ question wpf winforms

  • Optimization problem with sets
    N novice__geek

    Your problem sounds like the knapsack problem. 4^n just acts as item-id (given in this peculiar notation to confuse) while k is the capacity of the knapsack. Its easy to solve this problem using the method of dynamic programming. Brute-force approaches which rely on generating combination also exist.

    Algorithms algorithms performance help tutorial question

  • Shortest path related
    N novice__geek

    Yes... In fact this is also the brute-force method to solve micro-mouse maze. It always works.. :)

    Algorithms algorithms question
  • Login

  • Don't have an account? Register

  • Login or register to search.
  • First post
    Last post
0
  • Categories
  • Recent
  • Tags
  • Popular
  • World
  • Users
  • Groups