mayanknatani.wordpress.com
iCode | Algorithms notesAlgorithms notes
http://mayanknatani.wordpress.com/
Algorithms notes
http://mayanknatani.wordpress.com/
TODAY'S RATING
>1,000,000
Date Range
HIGHEST TRAFFIC ON
Saturday
LOAD TIME
0.4 seconds
16x16
32x32
PAGES IN
THIS WEBSITE
17
SSL
EXTERNAL LINKS
1
SITE IP
192.0.78.13
LOAD TIME
0.395 sec
SCORE
6.2
iCode | Algorithms notes | mayanknatani.wordpress.com Reviews
https://mayanknatani.wordpress.com
Algorithms notes
mayanknatani.wordpress.com
Bridges a.k.a. Cut Edges | iCode
https://mayanknatani.wordpress.com/2013/06/02/bridges-a-k-a-cut-edges
Bridges a.k.a. Cut Edges. Today we are going to learn that how to compute the edges of importance or essential edges or bridges or cut edges. The bridges are very similar to articulation points that we discussed in the last post. These are those edges which are essential for the graphs connectivity i.e. If I remove a bridge from the graph the rest of the graph will remain disconnected. Now how to find the bridges in a graph. Time Complexity : O(E*(V E). 1(ie v is not root) : (v,child).is bridge = true.
May | 2013 | iCode
https://mayanknatani.wordpress.com/2013/05
Monthly Archives: May 2013. Euclidean Minimum/Maximum Spanning Tree (EMST). Actually in euclidean MST problem all the ‘n’ points are connected to each other, and becomes the maximally dense graph. By virtue of that the order to compute the MST by using kruskal’s algo becomes (ElogE) where E = V 2 so order is greater than V 2 and in most cases the judges won’t accept it. So we can use prim’s here and can reduce our order to V 2. Euclidean minimum spanning tree. This entry was posted in Algorithms. Time co...
Running Median | iCode
https://mayanknatani.wordpress.com/2014/06/29/running-median
Today we gonna talk about how to keep track of median, given a stream of integers. We will discuss the most standard approach to solve the problem. Prerequisite : Heap Data Structure. 1 Heap Data Structure. 2 http:/ stackoverflow.com/questions/10657503/find-running-median-from-a-stream-of-integers. This entry was posted in Algorithms. June 29, 2014. Diameter of a Tree. Leave a Reply Cancel reply. Enter your comment here. Fill in your details below or click an icon to log in:. Address never made public).
Range Minimum Query | iCode
https://mayanknatani.wordpress.com/2013/07/15/range-minimum-query
Today we are going to learn about methods to find the minimum element in given range for an array, this problem is popularly known as range minimum query. First let us see, what are we looking at :. Given an array say A[0,N-1]. We are queried for the minimum element from some index ‘i’ to the index ‘j’ such that j =i, the notation for rest of the post for this will be RMQ(i,j). RMQ(0,2) = -1. RMQ(3,4) = 2. RMQ(0,4) = -1. 1 Naive’s Approach. Time Complexity : construction O(1) , Query O(N) O(1),O(N).
Computing nCr | iCode
https://mayanknatani.wordpress.com/2013/05/31/computing-ncr
Today we are going to talk about how to compute nCr in the programming competitions. 1 Dynamic programming Approach :. From the high school mathematics we know a recursive method to calculate nCr i.e. C(n,r) C(n,r-1) = C(n 1,r). This can also be written as. C(n,r) = C(n-1,r) C(n-1,r-1). It’s a very simple DP, as you can see nothing to be afraid of here. C[n][r] /* initialize the two dimensional array by - strong INF /strong combination(n,r): if (C[n][r]! Time complexity = O(n*r). Space complexity = O(n*r).
TOTAL PAGES IN THIS WEBSITE
17
Combination | COME ON CODE ON
https://comeoncodeon.wordpress.com/2011/07/31/combination
COME ON CODE ON. A blog about programming and more programming. In mathematics a combination. Is a way of selecting several things out of a larger group, where (unlike permutations) order does not matter. More formally a k-combination of a set S is a subset of k distinct elements of S. If the set has n elements the number of k-combinations is equal to the binomial coefficient. In this post we will see different methods to calculate the binomial. We can calculate nCr directly using the factorials. We can ...
TOTAL LINKS TO THIS WEBSITE
1
Mayank Multimedia Consultancy Services – IT Software and Education – INNOVATES KNOWLEDGE
Mayank Multimedia Consultancy Services. IT Software and Education - INNOVATES KNOWLEDGE. IT SOFTWARE AND EDUCATION. We provides software solutions and Eduction. Product / Service #1. Whatever your company is most known for should go right here, whether that's bratwurst or baseball caps or vampire bat removal. Product / Service #2. What's another popular item you have for sale or trade? Talk about it here in glowing, memorable terms so site visitors have to have it. Product / Service #3. 97;shish...
Investonomics
Monday, May 21, 2012. It’s been time that I have been waiting for my targets to be achieved since I wrote my last blog on 19. March 2012. Today on 21. May 2012 I can say that whatever has been written in my previous blog maybe it was for rupee dollar or for our economic growth or for Equity Market performance, I have been able to justify the behavioral investing is a successful technique and one can learn it easily but only thing which is required is Simplicity in investing and huge amount of discipline.
TECHNO-ROCKS
Tuesday, July 8, 2014. Good News Form Trai Minimum broadband speed is 512kbps now. Now a Data Connection is able to support the minimum speed upto 512kbps. You can read from here Click here. It may be recalled the government under its NATIONAL TELECOM POLICY 2012. Plan to raise the broadband download speed upto 512 Kbps from 256 mbps and. The Telecom Regulatory Authority of India (TRAI) has raised the minimum broadband speed limit from 256kbps to 512kbps. The regulator also amended the Telecom Consum...
Mayank Nagar's Blog
Count on Life not Money. Sunday, September 6, 2015. Things borrower must know about Pre Closing Home loan. Most people tend to take a home loan for 15 to 20 years as this usually offers the lowest home loan interest rates. Now to prepay the loan, you have to pay in Equated Monthly Installments (EMI) for the scheduled duration. However, if you wish to save on the interest, then pre closing your loan is a great option. So what does this mean? Here Are some Tips to Pre Close a Home Loan! Links to this post.
iCode | Algorithms notes
Today we gonna talk about how to keep track of median, given a stream of integers. We will discuss the most standard approach to solve the problem. Prerequisite : Heap Data Structure. 1 Heap Data Structure. 2 http:/ stackoverflow.com/questions/10657503/find-running-median-from-a-stream-of-integers. This entry was posted in Algorithms. June 29, 2014. Diameter of a Tree. Diameter of a Tree. The diameter of a given tree is the maximum distance between two nodes of a given tree. Visited[G[x][i] ){ flag = tru...
MayankP's Blog | Thoughts and Ideas for Microsoft Technologies (Dynamics CRM,C#.Net,ASP.Net)
Thoughts and Ideas for Microsoft Technologies (Dynamics CRM,C#.Net,ASP.Net). CRM AUDITING: SQL Database Standard to Enterprise version. So on MS CRM Audit Log screen we could not see any partition details available even though (as shown in screen print below) even though we are using enterprise version of SQL. So when new organization import process run then CRM system did not created these partition so we contacted Microsoft support and they provided following SQL script for this. And tagged CRM Auditing.
straight from the heart
Straight from the heart. I wanted to share my thoughts,my honest opinion about the happenings around me and my understanding of the same and some aspects of my personal life with all of you. Hopefully, what i write, will make some interesting and mentally stimulating reading for you folks. New Delhi, New Delhi, India. I am 32 years old with a beautiful wife, two awesome children, a labrador .a resonably rocking career in management consulting.life has been kind to me.thank you god. New years in bhutan.
Mayank Pandey - Web-Products Improvement - Complete Profile
mayankpandey photography
SOCIAL ENGAGEMENT