{"id":31800,"date":"2023-01-24T20:17:28","date_gmt":"2023-01-24T14:47:28","guid":{"rendered":"https:\/\/jassweb.com\/solved\/solved-finding-maximum-sum-possible-of-two-numbers-in-array\/"},"modified":"2023-01-24T20:17:28","modified_gmt":"2023-01-24T14:47:28","slug":"solved-finding-maximum-sum-possible-of-two-numbers-in-array","status":"publish","type":"post","link":"https:\/\/jassweb.com\/solved\/solved-finding-maximum-sum-possible-of-two-numbers-in-array\/","title":{"rendered":"[Solved] Finding maximum sum possible of two numbers in array"},"content":{"rendered":"

[ad_1]
\n<\/p>\n

\n
\n
<\/div>\n
\n
\n

As per assuming few conditions like provided array size and array data type to be integer you can use the following program for reference.
\nThis program takes the no. of elements and array as input.<\/p>\n

#include<stdio.h>\n#include<limits.h>\n\nint main(){\n\n    int n;\n    int a[100];\n    printf(\"Size of the array:\");\n    scanf(\"%d\", &n);\n    for(int i = 0; i < n; i++){\n        printf(\"Enter array element a[%d]:\", i);\n        scanf(\"%d\", &a[i]);\n        printf(\"\\n\");\n    }\n\n    int max = INT_MIN;\n    int sum = 0, k = 0, l = 0;\n    for(int i = 0; i < n-2; i++){\n        sum = a[i] + a[i+2];\n        if(max < sum){\n            max = sum;\n            k = i;\n            l = i+2;\n        }\n    }\n    printf(\"max sum is: %d using index: a[%d] and a[%d]\\n\", max, k, l);\n}\n<\/code><\/pre>\n
INPUT<\/em><\/p>\n
5<\/p>\n
-1 7 8 -5 4<\/p>\n
OUTPUT<\/em><\/p>\n
max sum is: 12 using index: a[2] and a[4]<\/p>\n<\/p><\/div>\n
<\/div>\n<\/div>\n
            2<\/span> <\/p><\/div>\n<\/div>\n
[ad_2]<\/p>\n
solved Finding maximum sum possible of two numbers in array <\/p>\n","protected":false},"excerpt":{"rendered":"
[ad_1] As per assuming few conditions like provided array size and array data type to be integer you can use the following program for reference. This program takes the no. of elements and array as input. #include<stdio.h> #include<limits.h> int main(){ int n; int a[100]; printf(“Size of the array:”); scanf(“%d”, &n); for(int i = 0; i … Read more<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[320],"tags":[361,324,561],"class_list":["post-31800","post","type-post","status-publish","format-standard","hentry","category-solved","tag-arrays","tag-c","tag-sorting"],"yoast_head":"\n[Solved] Finding maximum sum possible of two numbers in array - JassWeb<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/jassweb.com\/solved\/solved-finding-maximum-sum-possible-of-two-numbers-in-array\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"[Solved] Finding maximum sum possible of two numbers in array - JassWeb\" \/>\n<meta property=\"og:description\" content=\"[ad_1] As per assuming few conditions like provided array size and array data type to be integer you can use the following program for reference. This program takes the no. of elements and array as input. #include<stdio.h> #include<limits.h> int main(){ int n; int a[100]; printf("Size of the array:"); scanf("%d", &n); for(int i = 0; i ... Read more\" \/>\n<meta property=\"og:url\" content=\"https:\/\/jassweb.com\/solved\/solved-finding-maximum-sum-possible-of-two-numbers-in-array\/\" \/>\n<meta property=\"og:site_name\" content=\"JassWeb\" \/>\n<meta property=\"article:published_time\" content=\"2023-01-24T14:47:28+00:00\" \/>\n<meta name=\"author\" content=\"Kirat\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Kirat\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"1 minute\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/jassweb.com\/solved\/solved-finding-maximum-sum-possible-of-two-numbers-in-array\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/jassweb.com\/solved\/solved-finding-maximum-sum-possible-of-two-numbers-in-array\/\"},\"author\":{\"name\":\"Kirat\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31\"},\"headline\":\"[Solved] Finding maximum sum possible of two numbers in array\",\"datePublished\":\"2023-01-24T14:47:28+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/jassweb.com\/solved\/solved-finding-maximum-sum-possible-of-two-numbers-in-array\/\"},\"wordCount\":69,\"publisher\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#organization\"},\"keywords\":[\"arrays\",\"c++\",\"sorting\"],\"articleSection\":[\"Solved\"],\"inLanguage\":\"en-US\"},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/jassweb.com\/solved\/solved-finding-maximum-sum-possible-of-two-numbers-in-array\/\",\"url\":\"https:\/\/jassweb.com\/solved\/solved-finding-maximum-sum-possible-of-two-numbers-in-array\/\",\"name\":\"[Solved] Finding maximum sum possible of two numbers in array - JassWeb\",\"isPartOf\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#website\"},\"datePublished\":\"2023-01-24T14:47:28+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/jassweb.com\/solved\/solved-finding-maximum-sum-possible-of-two-numbers-in-array\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/jassweb.com\/solved\/solved-finding-maximum-sum-possible-of-two-numbers-in-array\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/jassweb.com\/solved\/solved-finding-maximum-sum-possible-of-two-numbers-in-array\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/jassweb.com\/solved\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"[Solved] Finding maximum sum possible of two numbers in array\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/jassweb.com\/solved\/#website\",\"url\":\"https:\/\/jassweb.com\/solved\/\",\"name\":\"JassWeb\",\"description\":\"Build High-quality Websites\",\"publisher\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/jassweb.com\/solved\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"},{\"@type\":\"Organization\",\"@id\":\"https:\/\/jassweb.com\/solved\/#organization\",\"name\":\"Jass Web\",\"url\":\"https:\/\/jassweb.com\/solved\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png\",\"contentUrl\":\"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png\",\"width\":693,\"height\":132,\"caption\":\"Jass Web\"},\"image\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/\"}},{\"@type\":\"Person\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31\",\"name\":\"Kirat\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1775798750\",\"contentUrl\":\"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1775798750\",\"caption\":\"Kirat\"},\"sameAs\":[\"http:\/\/jassweb.com\"],\"url\":\"https:\/\/jassweb.com\/solved\/author\/jaspritsinghghumangmail-com\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"[Solved] Finding maximum sum possible of two numbers in array - JassWeb","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/jassweb.com\/solved\/solved-finding-maximum-sum-possible-of-two-numbers-in-array\/","og_locale":"en_US","og_type":"article","og_title":"[Solved] Finding maximum sum possible of two numbers in array - JassWeb","og_description":"[ad_1] As per assuming few conditions like provided array size and array data type to be integer you can use the following program for reference. This program takes the no. of elements and array as input. #include<stdio.h> #include<limits.h> int main(){ int n; int a[100]; printf(\"Size of the array:\"); scanf(\"%d\", &n); for(int i = 0; i ... Read more","og_url":"https:\/\/jassweb.com\/solved\/solved-finding-maximum-sum-possible-of-two-numbers-in-array\/","og_site_name":"JassWeb","article_published_time":"2023-01-24T14:47:28+00:00","author":"Kirat","twitter_card":"summary_large_image","twitter_misc":{"Written by":"Kirat","Est. reading time":"1 minute"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/jassweb.com\/solved\/solved-finding-maximum-sum-possible-of-two-numbers-in-array\/#article","isPartOf":{"@id":"https:\/\/jassweb.com\/solved\/solved-finding-maximum-sum-possible-of-two-numbers-in-array\/"},"author":{"name":"Kirat","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31"},"headline":"[Solved] Finding maximum sum possible of two numbers in array","datePublished":"2023-01-24T14:47:28+00:00","mainEntityOfPage":{"@id":"https:\/\/jassweb.com\/solved\/solved-finding-maximum-sum-possible-of-two-numbers-in-array\/"},"wordCount":69,"publisher":{"@id":"https:\/\/jassweb.com\/solved\/#organization"},"keywords":["arrays","c++","sorting"],"articleSection":["Solved"],"inLanguage":"en-US"},{"@type":"WebPage","@id":"https:\/\/jassweb.com\/solved\/solved-finding-maximum-sum-possible-of-two-numbers-in-array\/","url":"https:\/\/jassweb.com\/solved\/solved-finding-maximum-sum-possible-of-two-numbers-in-array\/","name":"[Solved] Finding maximum sum possible of two numbers in array - JassWeb","isPartOf":{"@id":"https:\/\/jassweb.com\/solved\/#website"},"datePublished":"2023-01-24T14:47:28+00:00","breadcrumb":{"@id":"https:\/\/jassweb.com\/solved\/solved-finding-maximum-sum-possible-of-two-numbers-in-array\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/jassweb.com\/solved\/solved-finding-maximum-sum-possible-of-two-numbers-in-array\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/jassweb.com\/solved\/solved-finding-maximum-sum-possible-of-two-numbers-in-array\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/jassweb.com\/solved\/"},{"@type":"ListItem","position":2,"name":"[Solved] Finding maximum sum possible of two numbers in array"}]},{"@type":"WebSite","@id":"https:\/\/jassweb.com\/solved\/#website","url":"https:\/\/jassweb.com\/solved\/","name":"JassWeb","description":"Build High-quality Websites","publisher":{"@id":"https:\/\/jassweb.com\/solved\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/jassweb.com\/solved\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Organization","@id":"https:\/\/jassweb.com\/solved\/#organization","name":"Jass Web","url":"https:\/\/jassweb.com\/solved\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/","url":"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png","contentUrl":"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png","width":693,"height":132,"caption":"Jass Web"},"image":{"@id":"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/"}},{"@type":"Person","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31","name":"Kirat","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/person\/image\/","url":"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1775798750","contentUrl":"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1775798750","caption":"Kirat"},"sameAs":["http:\/\/jassweb.com"],"url":"https:\/\/jassweb.com\/solved\/author\/jaspritsinghghumangmail-com\/"}]}},"_links":{"self":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/posts\/31800","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/comments?post=31800"}],"version-history":[{"count":0,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/posts\/31800\/revisions"}],"wp:attachment":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/media?parent=31800"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/categories?post=31800"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/tags?post=31800"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}