## line segment intersection

Line segment intersection is classic computer science problem related to computer graphics or computed geometry. Your given two line segments and you need to write c or c++ program...

## maximum submatrix sum problem

Given a 2D matrix find the maximum submatrix sum in it. The matrix is containing positive and negative integers. For example The maximum submatrix sum is 15 in the...

## sieve of eratosthenes

sieve of eratosthenes is one of oldest and efficient algorithm for generating all prime numbers less than or equal to a given number N. For example if given number...

## c program for bfs using adjacency matrix

write c program for bfs using adjacency matrix. For example the breadth first search of below graph from 0th vertex would be 0 1 2 6 3 4. We...

## Max flow problem Ford Fulkerson algorithm

Max flow problem The max flow problem can be defined as “Given a flow network as directed graph, where each edge has a capacity greater than 0 and two...

## Euler Cycles and Paths in Graph

Euler Path is a path in a graph which crosses every edge of a graph exactly once, while euler cycles is a euler path such a way that start...

## All pair shortest path floyd warshall algorithm

All pair shortest path floyd warshall algorithm. All pair shortest path is problem of finding shortest distance between every pair of vertices/nodes in a given directed weighted graph. floyd...

## kth largest element in array in c

Write a C program to find kth largest elements in array in c ( from given unordered list or array). For example if given list is 2,3,4,5,12,8,10,6,20,7,21, 22 ,25...

## count number of 1s in binary

Write an efficient function in c to print the count of 1s in binary representation of a given number. For example if given number is 7 then its binary...

## C program square root using Babylonian method

Write a C program square root using Babylonian method. Babylonian method of finding square root is one of the oldest method. It uses divide and average technique. It is...