17EGICS121

17EGICS018_ARRAY_11

@@ -0,0 +1,30 @@
+#include<stdio.h>
+int main()
+{
+	int i, j, k, n, sum, max = 0;
+	printf("Enter the size of the array: ");
+	scanf("\n%d",&n);
+	int a[n];
+	printf("Enter the array element: \n");
+	for(i=0;i<n;i++)
+	{
+		scanf("%d",&a[i]);
+	}
+
+  	for(i=0; i<n; i++)
+  	{
+    	for(j=i; j<n; j++)
+    	{
+      		sum = 0;
+      		for(k=i ; k<j; k++)
+      		{
+        		sum = sum + a[k];
+      		}
+      		if(sum>max){
+      			max=sum;
+			}
+        }
+    }
+	printf("\n%d",max);
+	return 0;
+}

17EGICS024_Array_10.cpp

@@ -0,0 +1,52 @@
+#include<iostream>
+#include<conio.h>
+using namespace std;
+int main()
+{
+	int *p;
+	int n,i,target,lb,ub,mid;
+	cout<<"Enter Size of array:";
+	cin>>n;
+	p=new int[n];
+	if(n<1)
+	{
+		exit(0);
+	}
+	cout<<"\nEnter array Elements:\n";
+	for(i=0;i<n;i++)
+	{
+		cin>>p[i];
+	}
+	cout<<"\nEnter Target Value:";
+	cin>>target;
+	lb=0;
+	ub=n-1;
+	mid=(lb+ub)/2;
+	while(lb<=ub)
+	{
+		if(target==p[mid])
+		{
+			cout<<mid;
+			exit(0);
+		}
+		else if(target>p[mid])
+		{
+			lb=mid+1;
+		}
+		else
+		{
+			ub=mid-1;
+		}
+		mid=(lb+ub)/2;
+	}
+	if(target>p[ub])
+	{
+		cout<<ub+1;
+	}
+	else
+	{
+		cout<<lb-1;
+	}
+	getch();
+	return 0;
+}

17EGICS030_ARRAY_11.py

@@ -0,0 +1,27 @@
+#ASSIGNEMENT-5
+#Given an array of N integers, find the contiguous subarray (containing at least one number) 
+# which has the largest sum and print its sum.
+
+def maxSubarray(arr):
+    sum=0
+    maxSum=max(arr)
+    subArray=[]
+    for ele in arr:
+        sum += ele
+        if(sum<0):
+            sum=0
+            subArray=[]
+        if(maxSum<sum):
+            maxSum=sum
+    print("SUBARRAY IS: ",subArray)
+    return maxSum
+
+size=int(input(("Enter the size of array: ")))
+s=size
+arr=[]
+
+for i in range(size):
+    num=int(input())
+    arr.append(num)
+
+print("MAXIMUM SUM: ",maxSubarray(arr))

17EGICS030_ARRRAY_10.py

@@ -0,0 +1,35 @@
+#ASSIGNMENT 5
+#Given an array of N integers and a target value, print the index if the target is found. 
+# If not, print the index where it would be if it were inserted in order.
+# You may assume no duplicates in the array.
+
+index=0
+n=int(input(("Enter the size of array: ")))
+t=int(input("Enter the target value: "))
+print("Enter the array elements: ")
+flag=False
+arr=[]
+
+for i in range(n):
+    num=int(input())
+    arr.append(num)
+    if not flag:
+        if (arr[i] == t):
+            flag=True
+            index=i
+        if arr[i-1]<t and arr[i]>t:
+            flag=True
+            n=n+1
+            arr.insert(i,t)
+            index=i
+if not flag and arr[n-1]<t:
+    arr.append(t)
+    index=n
+    flag=True
+elif not flag and arr[0]>t:
+    arr.insert(0,t)
+    index=0
+    flag=True
+
+print(arr)
+print("INDEX OF TARGET VALUE IN ARRAY: ",index)

17EGICS057_array_11

@@ -0,0 +1,26 @@
+#include<stdio.h>
+void main()
+{
+	int n,i;
+	printf("enter size of array");
+	scanf("%d",&n);
+	int a[n],curr_sum=0,max_sum=0;
+	printf("enter array elements\n");
+	for(i=0;i<n;i++)
+	{
+		scanf("%d",&a[i]);
+	}
+	for(i=0;i<n;i++)
+	{
+		curr_sum=curr_sum+a[i];
+		if(curr_sum<0)
+		{
+			curr_sum=0;
+		}
+		else if(max_sum<curr_sum)
+		{
+			max_sum=curr_sum;
+		}
+	}
+	printf("%d",max_sum);
+}

17EGICS077_assignment5_Q10

@@ -0,0 +1,26 @@
+#include<stdio.h>
+int main()
+{
+	int l,i,t;
+	printf("LENGHT OF ARRAY: ");
+	scanf("%d",&l);
+	int x[l];
+	printf("TARGET VALUE: ");
+	scanf("%d",&t);
+	printf("ENTER ARRAY ELEMENT :\n");
+	for(i=0;i<l;i++)
+	{
+		scanf("%d",&x[i]);
+	}
+	for(i=0;i<l;i++)
+	{
+		if(t==x[i])
+		{
+			printf("postion is %d of element %d ",i,x[i]);
+		}
+		else if(t>x[i] && t<x[i+1])
+		{
+			printf("element %d is enter on postion %d",t,(i+1));
+		}
+	}
+}

17EGICS077_assignment5_Q11

@@ -0,0 +1,27 @@
+#include<stdio.h>
+int main()
+{
+	int k=0,i,l,j,sum;
+	printf("LENGHT OF ARRAY: ");
+	scanf("%d",&l);
+	int x[l];
+	printf("ENTER ARRAY ELEMENT :\n");
+	for(i=0;i<l;i++)
+	{
+		scanf("%d",&x[i]);
+	}
+	for(i=0;i<l;i++)
+	{
+		sum=0;
+		sum=x[i];
+		for(j=i+1;j<l;j++)
+		{
+			sum=sum+x[j];
+			if(k<sum)
+			{
+				k=sum;
+			}
+		}
+	}
+	printf("%d",k);
+}

17EGICS121_ARRAY_ASSIGNMENT_2(1).txt

@@ -0,0 +1,28 @@
+#include<stdio.h>
+int main()
+{
+    int i,j,n=0;
+    int flag;
+    printf("\nenter no of elements:");
+    scanf("%d",&n);
+    int a[n];
+    for (i=0; i<n; i++) {
+        scanf("%d",&a[i]);
+    }
+    for (i=0; i<n; i++)
+    {
+        flag = 1;
+        for(j=0;j<n;j++)
+        {
+            if(a[i] == a[j]&&i!=j)
+            {
+                flag = 0;
+            }
+        }
+        if(flag == 1)
+        {
+            printf("\nnon-repeating element is: '%d'\n",a[i]);
+        }
+    }
+    return 0;
+}

17EGICS121_ARRAY_ASSIGNMENT_2(2).txt

@@ -0,0 +1,35 @@
+#include <stdio.h>
+#include <string.h>
+int main()
+{
+    int i,j,n,s;
+    char temp;
+    printf("\nenter no of chars: ");
+    scanf("%d",&n);
+    char a[n];
+    printf("\nenter string: ");
+    scanf("%s",&a);
+    //it is assumed that characters will be equal to 'n' otherwise we can use 'for' loop.
+    printf("\nenter no of right shift steps: ");
+    scanf("%d",&s);
+    if(s%n==0&&(strlen(a)==n)){
+        printf("after shift: %s\n",a);
+    }
+    else{
+        while(s/n != 0){
+            printf("%d\n",s/n);
+            s=s%n;
+        }
+
+        for(i=0;i<s;i++){
+            temp = a[n-1];
+            for (j=n-2; j>=0; j--){
+                a[j+1] = a[j];
+            }
+            a[0] = temp;
+        }
+    if(s%n!=0){
+        printf("\n\nresult: %s",a);
+    }
+}
+}

17EGICS121_Array_assignment_3(1).c

@@ -0,0 +1,24 @@
+#include <stdio.h>
+#include <string.h>
+int main()
+{
+    	int i,max1=0,max2=0,result=0,n=0;
+	printf("\n enter no of elements:");
+	scanf("%d",&n);
+	int arr[n];
+	printf("\nenter elements:");
+	for(i=0;i<n;i++)
+	{
+		scanf("%d",&arr[i]);
+		if(arr[i]>max1)
+		{
+			max2=max1;
+			max1=arr[i];
+
+		}
+		else if(max2<arr[i]){
+			max2=arr[i];
+		}
+	}
+	printf("\nmax1= %d,max2 = %d\nProduct: %d\n",max1,max2,max1*max2);
+}

17EGICS121_Array_assignment_3(2).c

@@ -0,0 +1,31 @@
+#include <stdio.h>
+#include <string.h>
+int main()
+{
+    int i,num=0,sum1=0,sum2=0,count1=0,count2=0,n=0;
+	printf("\n enter no of elements:");
+	scanf("%d",&n);
+	int arr[n];
+	printf("\nenter elements:");// assuming the integers as positive numbers
+	for(i=0;i<n;i++)
+	{
+		scanf("%d",&arr[i]);
+		if(arr[i]>num)
+		{
+			sum1+=arr[i];
+			num = arr[i];
+			count1++;
+		}
+		else{
+            count1 = 1;
+            sum1 = arr[i];
+            num = arr[i];
+			}
+        if(count1>count2)
+        {
+            count2 = count1;
+            sum2 = sum1;
+		}
+	}
+	printf("\nlongest increasing order sum is: %d,&count=%d\n",sum2,count2);
+}

17EGICS121_Assignment_7_a.cpp

@@ -0,0 +1,28 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+    int i,j,n; bool flag=false;
+    cout<<"enter no of elements:";
+    cin>>n;
+    int a[n];
+    cout<<"enter elements :\n";
+    for(i=0;i<n;i++)
+    {
+        cin>>a[i];
+    }
+    sort(a,a+n);
+    for(i=0,j=i+1;i<n;i++,j++)
+    {
+        if(a[i] == a[j])
+        {
+            flag = true; break;
+        }
+    }
+    if(flag==true){
+        cout<<"\ntrue\n";
+    }
+    else{
+        cout<<"\nfalse\n";
+    }
+}