Skip to content
CodeMarvels
All's the Code !
  • Home
  • Privacy Policy
  • About

Category: Algorithms

Algorithms

Dijkstra’s Algorithm

Posted on July 29, 2013 by saurabh / 0 Comment

Given a network of cities and the distances between them,the task is to find the shortest path from a city(source) to all other cities connected to it.The netwo...

Algorithms

Prims Algorithm

Posted on July 29, 2013 by saurabh / 0 Comment

Let G=(V,E) be an undirected,connected and weighted graph.A sub-graph T=(V,E’) of G is a spanning tree of G if T is a tree.There may be several spanning t...

Algorithms

Minimum Cost Path (DP Example)

Posted on July 27, 2013 by saurabh / 0 Comment

Dynamic programming is a method for solving complex problems by breaking them down into simpler sub-problems. It is applicable to problems exhibiting the proper...

Algorithms

Magic Square

Posted on July 24, 2013 by saurabh / 0 Comment

A magic square is an arrangement of numbers in a square grid, where the numbers in each row, and in each column, and the numbers in the forward and backward mai...

Algorithms

Largest multiple of 3

Posted on July 23, 2013 by saurabh / 0 Comment

Given an array of digits,the task is to find the largest multiple of 3 that can be formed from array elements. Example- Input array is {4,8,0}.Then,the largest ...

Algorithms

Fibonacci Numbers

Posted on July 21, 2013 by saurabh / 0 Comment

Fibonacci is the most famous sequence in the programming world. It is defined by the following recursive formulation: f(n)=f(n-1) + f(n-2) where f(0)=0 & f(...

Algorithms

BFS & DFS

Posted on July 21, 2013 by saurabh / 0 Comment

A traversal is a systematic walk which visits the nodes of the graph in a specific order. Two Types:- 1.Breadth First Traversal 2.Depth First Traversal Breadth ...

Algorithms

All about Factorial(!)

Posted on July 20, 2013 by saurabh / 0 Comment

In mathematics,the factorial of any positive number N is the product of the positive integers less than or equal to N.It is denoted by ‘N!’. Example...

Algorithms

Binomial Coefficient

Posted on July 16, 2013 by saurabh / 0 Comment

Binomial Coefficient is represented by nCk which means number of ways of choosing k objects from n objects.It is the coefficient of x^k term in the polynomial e...

Algorithms

Longest Increasing Sub-sequence

Posted on July 14, 2013 by saurabh / 0 Comment

Given a sequence of numbers,we need to find the longest increasing sub-sequence from the given input(not necessary continuous). Example- Input- 1 10 4 5 3 2 9 1...

Posts navigation

« Previous 1 2 3 Next »

Categories

  • Algorithms
  • Android Development
  • BoshServlet
  • C++ projects
  • Code Philosophies
  • Conversational AI
  • Machine Learning
  • Miscellaneous
  • Notes
  • Society
  • Technology
  • Tutorial / Run-book
  • Uncategorized

Recent Posts

  • SSH without running .bashrc
  • Migrate data from one Cassandra server to another using medusa
  • A JS assistant to remind us to exercise during WFH days
  • Flush DNS cache in Ubuntu 20.xx and above
  • Change the datacenter set in cassandra-rackdc on Ubuntu

Meta

  • Log in
  • Entries feed
  • Comments feed
  • WordPress.org
© 2022 CodeMarvels
Powered by WordPress | Theme: Graphy by Themegraphy