Shubham Raj srshubham77

srshubham77 / MaximumSumSubarray_Kadane.cpp

Created December 16, 2017 13:43 — forked from mycodeschool/MaximumSumSubarray_Kadane.cpp

	#include<cmath>
	#include<iostream>
	#include<climits>
	using namespace std;

	int Maximum_Sum_Subarray(int arr[],int n) //Overall Time Complexity O(n)
	{
	int ans = A[0],sum = 0;
	for(int i = 1;i < n; ++i) //Check if all are negative
	ans = max(ans,arr[i]);

srshubham77 / MergeSort_C.C

Created December 16, 2017 13:43 — forked from mycodeschool/MergeSort_C.C

	/* Merge sort in C */
	#include<stdio.h>
	#include<stdlib.h>

	// Function to Merge Arrays L and R into A.
	// lefCount = number of elements in L
	// rightCount = number of elements in R.
	void Merge(int A,int L,int leftCount,int *R,int rightCount) {
	int i,j,k;