{"id":6809,"date":"2025-06-15T22:48:15","date_gmt":"2025-06-15T17:18:15","guid":{"rendered":"https:\/\/namastedev.com\/blog\/?p=6809"},"modified":"2025-10-22T11:02:14","modified_gmt":"2025-10-22T05:32:14","slug":"find-largest-number-in-an-array","status":"publish","type":"post","link":"https:\/\/namastedev.com\/blog\/find-largest-number-in-an-array\/","title":{"rendered":"Find Largest Number in an Array"},"content":{"rendered":"\n<!-- PrismJS for Syntax Highlighting -->\n<link href=\"https:\/\/cdn.jsdelivr.net\/npm\/prismjs@1.29.0\/themes\/prism-tomorrow.min.css\" rel=\"stylesheet\">\n<script src=\"https:\/\/cdn.jsdelivr.net\/npm\/prismjs@1.29.0\/prism.min.js\"><\/script>\n<script src=\"https:\/\/cdn.jsdelivr.net\/npm\/prismjs@1.29.0\/plugins\/autoloader\/prism-autoloader.min.js\"><\/script>\n\n<style>\n.wp_blog_theme {\n  --primary: #E58C32;\n  --secondary: #030302;\n  --light-bg: #fef9f4;\n  --text-dark: #2d2d2d;\n  --tab-radius: 12px;\n  --shadow: 0 4px 12px rgba(0, 0, 0, 0.08);\n  --code-bg: #001f3f;\n  --code-text: #d4f1ff;\n}\n\n.wp_blog_container {\n  font-family: 'Segoe UI', sans-serif;\n  background: var(--light-bg);\n  margin: 0;\n  padding: 0;\n  color: var(--text-dark);\n}\n\n\/* Heading *\/\n.wp_blog_main-heading {\n  text-align: center;\n  font-size: 2.4rem;\n  color: var(--primary);\n  margin-top: 2.5rem;\n  font-weight: bold;\n}\n\n\/* Explanation Card *\/\n.wp_blog_explanation,\n.wp_blog_code-tabs-container {\n  max-width: 940px;\n  margin: 2rem auto;\n  padding: 2rem;\n  background: white;\n  border-radius: var(--tab-radius);\n  box-shadow: var(--shadow);\n}\n\n\/* Text and Visuals *\/\n.wp_blog_explanation h2 {\n  font-size: 1.4rem;\n  color: var(--primary);\n  margin-bottom: 0.5rem;\n}\n\n.wp_blog_explanation p,\n.wp_blog_explanation li {\n  font-size: 1.05rem;\n  line-height: 1.7;\n  margin: 0.5rem 0;\n}\n\n.wp_blog_explanation code {\n  background: #fef9f4;   \/* light bg instead of dark blue *\/\n  color: #E58C32;        \/* brand orange *\/\n  padding: 3px 6px;\n  border-radius: 4px;\n  font-family: 'Courier New', monospace;\n  font-weight: 600;      \/* optional, makes it pop *\/\n}\n\n.wp_blog_explanation img {\n  max-width: 100%;\n  border-radius: var(--tab-radius);\n  margin-top: 1rem;\n  box-shadow: 0 2px 12px rgba(0, 0, 0, 0.06);\n}\n\n\/* Tab Buttons *\/\n.wp_blog_code-tabs-header {\n  display: flex;\n  flex-wrap: wrap;\n  gap: 0.5rem;\n  margin-bottom: 1rem;\n}\n\n.wp_blog_code-tab-button {\n  padding: 0.6rem 1.2rem;\n  border: 1px solid var(--primary);\n  background: white;\n  color: var(--primary);\n  border-radius: 50px;\n  font-weight: 600;\n  cursor: pointer;\n  transition: all 0.3s ease;\n}\n\n.wp_blog_code-tab-button:hover {\n  background: var(--secondary);\n}\n\n.wp_blog_code-tab-button.active {\n  background: var(--primary);\n  color: white;\n}\n\n\/* Code Content *\/\n.wp_blog_code-tab-content {\n  display: none;\n  background: var(--code-bg);\n  border-radius: var(--tab-radius);\n}\n\n.wp_blog_code-tab-content.active {\n  display: block;\n}\n\n.wp_blog_code-tab-content pre {\n  margin: 0;\n  padding: 1.5rem;\n  font-size: 1rem;\n  overflow-x: auto;\n  background: var(--code-bg);\n  border-radius: var(--tab-radius);\n  color: var(--code-text);\n}\n\n\/* Dark mode variables *\/\n.wp_blog_theme.dark-mode {\n  --light-bg: #121212;\n  --text-dark: #f5f5f5;\n  --shadow: 0 4px 12px rgba(255, 255, 255, 0.08);\n  --code-bg: #1e1e1e;\n  --code-text: #c5f0ff;\n}\n\n.wp_blog_theme.dark-mode .wp_blog_explanation {\n  background: #1e1e1e;\n}\n\n\/* Dark mode code highlight *\/\n.wp_blog_theme.dark-mode .wp_blog_explanation code {\n  background: #333;\n  color: #ffd27f;\n}\n\n.wp_blog_theme {\n  position: relative; \/* makes it the reference for absolute children *\/\n}\n\n.wp_blog_toggle-btn {\n  position: absolute;\n  top: 1rem;\n  right: 1rem;\n  z-index: 9999;\n  padding: 0.5rem 0.8rem;\n  border-radius: 10%;\n  background: var(--primary);\n  color: white;\n  font-weight: bold;\n  cursor: pointer;\n  border: none;\n  box-shadow: var(--shadow);\n  transition: background 0.3s, transform 0.2s;\n}\n\n.wp_blog_toggle-btn:hover {\n  background: #cc772e;\n}\n\n.wp_blog_theme.dark-mode .wp_blog_code-tabs-container {\n  background: #1e1e1e;\n}\n<\/style>\n\n\n<div class=\"wp_blog_container wp_blog_theme\">\n    <button id=\"blogNotesThemeToggle\" class=\"wp_blog_toggle-btn\">\ud83c\udf19<\/button>\n  <h1 class=\"wp_blog_main-heading\">\n  <\/h1>\n  \n  <div class=\"wp_blog_explanation\">\n    <h2>Problem Statement:<\/h2>\n    <p>\n      Write a function that returns the largest number in an array.\n    <\/p>\n\n    <h2>Approach:<\/h2>\n    <ul>\n      <li>Initialize a variable<code>largest<\/code>to <code>-Infinity<\/code>.<\/li>\n      <li>Loop through the array.<\/li>\n      <li>If the current element is greater than <code>largest<\/code>, update <code>largest<\/code>.<\/li>\n      <li>Return <code>largest<\/code> after the loop ends.<\/li>\n    <\/ul>\n    \n    <h2>Example:<\/h2>\n    <p><strong>Input:<\/strong> arr = [2, -6, 4, 8, 1, -9]<\/p>\n    <p><strong>Output:<\/strong>8<\/p>\n    \n    <h2>Time &#038; Space Complexity:<\/h2>\n    <p>\n      <code>Time Complexity: O(n)<\/code>&#8211; where <strong>n<\/strong> is\n      the number of elements in the array.\n    <\/p>\n    <p>\n      <code>Space Complexity: O(1)<\/code>&#8211; Only a counter variable is\n      used.\n    <\/p>\n    \n    <h2>Visualisation:<\/h2>\n    <img decoding=\"async\"\n    src=\"https:\/\/namastedev.com\/blog\/wp-content\/uploads\/2025\/06\/Screenshot-2025-06-21-at-12.47.37\u202fAM.png\"\n    alt=\"Visual representation of sum\"\n    \/>\n  <\/div>\n  \n  <div class=\"wp_blog_code-tabs-container\">\n    <div class=\"wp_blog_code-tabs-header\">\n      <button class=\"wp_blog_code-tab-button active\" data-lang=\"js\">\n        JavaScript\n      <\/button>\n      <button class=\"wp_blog_code-tab-button\" data-lang=\"py\">Python<\/button>\n      <button class=\"wp_blog_code-tab-button\" data-lang=\"java\">Java<\/button>\n      <button class=\"wp_blog_code-tab-button\" data-lang=\"cpp\">C++<\/button>\n      <button class=\"wp_blog_code-tab-button\" data-lang=\"c\">C<\/button>\n      <button class=\"wp_blog_code-tab-button\" data-lang=\"cs\">C#<\/button>\n    <\/div>\n    \n    <div class=\"wp_blog_code-tab-content active\" data-lang=\"js\">\n      <pre><code class=\"language-javascript\">\n        function findLargest(arr) {\n          let largest = -Infinity;\n          for (let i = 0; i < arr.length; i++) {\n            if (arr[i] > largest) {\n              largest = arr[i];\n            }\n          }\n          return largest;\n        }\n        let arr = [2, -6, 4, 8, 1, -9];\n        let result = findLargest(arr);\n        console.log(\"Result:\", result); \/\/ Output: 8\n      <\/code><\/pre>\n    <\/div>\n    <div class=\"wp_blog_code-tab-content\" data-lang=\"py\">\n      <pre><code class=\"language-python\">\n        def find_largest(arr):\n        largest = float('-inf')\n        for num in arr:\n        if num > largest:\n        largest = num\n        return largest\n        arr = [2, -6, 4, 8, 1, -9]\n        result = find_largest(arr)\n        print(\"Result:\", result)  # Output: 8\n      <\/code><\/pre>\n    <\/div>\n    \n    <div class=\"wp_blog_code-tab-content\" data-lang=\"java\">\n      <pre><code class=\"language-java\">\n        public class Main {\n          public static int findLargest(int[] arr) {\n            int largest = Integer.MIN_VALUE;\n            for (int num : arr) {\n              if (num > largest) {\n                largest = num;\n              }\n            }\n            return largest;\n          }\n          public static void main(String[] args) {\n            int[] arr = {2, -6, 4, 8, 1, -9};\n            int result = findLargest(arr);\n            System.out.println(\"Result: \" + result); \/\/ Output: 8\n          }\n        }   <\/code><\/pre>\n      <\/div>\n      \n      <div class=\"wp_blog_code-tab-content\" data-lang=\"cpp\">\n        <pre><code class=\"language-cpp\">\n          #include &lt;iostream&gt;\n          using namespace std;\n          int findLargest(int arr[], int n) {\n            int largest = INT_MIN;\n            for (int i = 0; i < n; i++) {\n              if (arr[i] > largest) {\n                largest = arr[i];\n              }\n            }\n            return largest;\n          }\n          int main() {\n            int arr[] = {2, -6, 4, 8, 1, -9};\n            int result = findLargest(arr, 6);\n            cout &lt;&lt; \"Result: \" &lt;&lt; result &lt;&lt; endl; \/\/ Output: 8\n            return 0;\n          }\n        <\/code><\/pre>\n      <\/div>\n      \n      <div class=\"wp_blog_code-tab-content\" data-lang=\"c\">\n        <pre><code class=\"language-c\">\n          #include &lt;stdio.h&gt;\n          int findLargest(int arr[], int n) {\n            int largest = -2147483648; \/\/ INT_MIN\n            for (int i = 0; i < n; i++) {\n              if (arr[i] > largest) {\n                largest = arr[i];\n              }\n            }\n            return largest;\n          }\n          int main() {\n            int arr[] = {2, -6, 4, 8, 1, -9};\n            int result = findLargest(arr, 6);\n            printf(\"Result: %d\\n\", result); \/\/ Output: 8\n            return 0;\n          }\n        <\/code><\/pre>\n      <\/div>\n      <div class=\"wp_blog_code-tab-content\" data-lang=\"cs\">\n        <pre><code class=\"language-csharp\">\n          using System;\n          class Program\n          {\n            static void Main()\n            {\n              int[] arr = { 2, -6, 4, 8, 1, -9 };\n              int largest = FindLargest(arr);\n              Console.WriteLine(\"Largest number in the array: \" + largest);\n            }\n            static int FindLargest(int[] arr)\n            {\n              int largest = arr[0];\n              for (int i = 1; i < arr.Length; i++)\n              {\n                if (arr[i] > largest)\n                {\n                  largest = arr[i];\n                }\n              }\n              return largest;\n            }\n          }\n        <\/code><\/pre>\n      <\/div>\n    <\/div>\n<\/div>\n\n\n<script>\ndocument.addEventListener(\"DOMContentLoaded\", () => {\n  const buttons = document.querySelectorAll(\".wp_blog_code-tab-button\");\n  const contents = document.querySelectorAll(\".wp_blog_code-tab-content\");\n\n  buttons.forEach((button) => {\n    button.addEventListener(\"click\", () => {\n      const lang = button.getAttribute(\"data-lang\");\n\n      buttons.forEach((btn) => btn.classList.remove(\"active\"));\n      contents.forEach((content) => content.classList.remove(\"active\"));\n\n      button.classList.add(\"active\");\n      document\n        .querySelector(`.wp_blog_code-tab-content[data-lang=\"${lang}\"]`)\n        .classList.add(\"active\");\n    });\n  });\n\n  const themeToggle = document.getElementById(\"blogNotesThemeToggle\");\n  const themeContainer = document.querySelector(\".wp_blog_theme\");\n\n  themeToggle.addEventListener(\"click\", () => {\n    themeContainer.classList.toggle(\"dark-mode\");\n    themeToggle.textContent =\n      themeContainer.classList.contains(\"dark-mode\") ? \"\u2600\ufe0f\" : \"\ud83c\udf19\";\n  });\n});\n<\/script>\n\n","protected":false},"excerpt":{"rendered":"<p>\ud83c\udf19 Problem Statement: Write a function that returns the largest number in an array. Approach: Initialize a variablelargestto -Infinity. Loop through the array. If the current element is greater than largest, update largest. Return largest after the loop ends. Example: Input: arr = [2, -6, 4, 8, 1, -9] Output:8 Time &#038; Space Complexity: Time<\/p>\n","protected":false},"author":108,"featured_media":0,"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,"footnotes":""},"categories":[322,260,176,175,211,811,810,174,172,173],"tags":[],"class_list":{"0":"post-6809","1":"post","2":"type-post","3":"status-publish","4":"format-standard","6":"category-algorithms-and-data-structures","7":"category-c-c-plus-plus","8":"category-csharp","9":"category-cplusplus","10":"category-data-structures","11":"category-data-structures-and-algorithms","12":"category-dsa","13":"category-java","14":"category-javascript","15":"category-python"},"aioseo_notices":[],"_links":{"self":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts\/6809","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/users\/108"}],"replies":[{"embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/comments?post=6809"}],"version-history":[{"count":7,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts\/6809\/revisions"}],"predecessor-version":[{"id":10523,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts\/6809\/revisions\/10523"}],"wp:attachment":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/media?parent=6809"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/categories?post=6809"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/tags?post=6809"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}