Algorithms

int atoi( char* pStr ) { int iRetVal = 0; if (pStr) { while ( *pStr && *pStr = '0' ) { iRetVal ...

The idea is to check for following two conditions. If following two conditions are true, then return true. 1) max – min + 1 = n where max...

A majority element in an array A[] of size n is an element that appears more than n/2 times (and hence there is at most one such element)....

Implement the following function, FindSortedArrayRotation, which takes as its input an array of unique integers that has been sorted in asce...

Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). How do you fi...

Prim's Algorithm : Click Here Kruskal's Algorithm : Click Here

Given a Linked List of integers, write a function to modify the linked list such that all even numbers appear before all the odd numbers ...