swap two numbers without using a temporary variable
swap two numbers without using a temporary variable-Bit Algorithm-Given two variables, x and y, swap two variables without...
Author
Venkatesan Prabu
Wikitechy Founder, Author, International Speaker, and Job Consultant. My role as the CEO of Wikitechy, I help businesses build their next generation digital platforms and help with their product innovation and growth strategy. I'm a frequent speaker at tech conferences and events.
2834 Articles
Java Algorithm – Maximum Bipartite Matching
Java Algorithm - Maximum Bipartite Matching - Graph Algorithm - A matching in a Bipartite Graph is a set of the edges chosen...
C++ Programming Karatsuba algorithm for fast multiplication
Karatsuba algorithm for fast multiplication - Given two binary strings that represent value of two integers, find the...
Greedy Algorithms | Set 9 (Boruvka’s algorithm)
Greedy Algorithms Boruvka’s algorithm - Minimum Spanning Tree Like Prim’s and Kruskal’s, Boruvka’s algorithm is also a...
C Programming Find position of the only set bit
C Programming Find position of the only set bit - Given a number having only one ‘1’ and all other ’0’s in its binary...
C++ Programming-Swap all odd and even bits
Given an unsigned integer, swap all odd bits with even bits. For example, if the given number is 23 (00010111), it should be...
C Programming-Swap all odd and even bits
Given an unsigned integer, swap all odd bits with even bits. For example, if the given number is 23 (00010111), it should be...
Maximum size square sub-matrix with all 1s
Maximum size square sub-matrix with all 1s - Dynamic Programming Given a binary matrix, find out the maximum size square...
Minimum number of jumps to reach end
Minimum number of jumps to reach end - Dynamic Programming An array of integers where elements represents the max number of...
Randomized Algorithms | Set 0 (Mathematical Background)
Since B has already happened, the sample space reduces to B. So the probability of A happening becomes P(A ∩ B) divided by...
