<ruby id="bdb3f"></ruby>

    <p id="bdb3f"><cite id="bdb3f"></cite></p>

      <p id="bdb3f"><cite id="bdb3f"><th id="bdb3f"></th></cite></p><p id="bdb3f"></p>
        <p id="bdb3f"><cite id="bdb3f"></cite></p>

          <pre id="bdb3f"></pre>
          <pre id="bdb3f"><del id="bdb3f"><thead id="bdb3f"></thead></del></pre>

          <ruby id="bdb3f"><mark id="bdb3f"></mark></ruby><ruby id="bdb3f"></ruby>
          <pre id="bdb3f"><pre id="bdb3f"><mark id="bdb3f"></mark></pre></pre><output id="bdb3f"></output><p id="bdb3f"></p><p id="bdb3f"></p>

          <pre id="bdb3f"><del id="bdb3f"><progress id="bdb3f"></progress></del></pre>

                <ruby id="bdb3f"></ruby>

                ??碼云GVP開源項目 12k star Uniapp+ElementUI 功能強大 支持多語言、二開方便! 廣告
                # 程序以查找數組中的最大元素 > 原文: [https://www.geeksforgeeks.org/c-program-find-largest-element-array/](https://www.geeksforgeeks.org/c-program-find-largest-element-array/) 給定一個數組,在其中找到最大的元素。 **示例**: ``` Input : arr[] = {10, 20, 4} Output : 20 Input : arr[] = {20, 10, 20, 4, 100} Output : 100 ``` 解決方案是將`max`初始化為第一個元素,然后從第二個元素遍歷給定的數組直至結束。 對于每個遍歷的元素,將其與`max`進行比較,如果它大于`max`,則更新`max`。 ## C++ ```cpp // C++ program to find maximum // in arr[] of size n? #include <bits/stdc++.h> using namespace std; int largest(int arr[], int n) { ????int i; ????// Initialize maximum element ????int max = arr[0]; ????// Traverse array elements? ????// from second and compare ????// every element with current max? ????for (i = 1; i < n; i++) ????????if (arr[i] > max) ????????????max = arr[i]; ????return max; } // Driver Code int main() { ????int arr[] = {10, 324, 45, 90, 9808}; ????int n = sizeof(arr) / sizeof(arr[0]); ????cout << "Largest in given array is "? ?????????<< largest(arr, n); ????return 0; } // This Code is contributed? // by Shivi_Aggarwal ```
                  <ruby id="bdb3f"></ruby>

                  <p id="bdb3f"><cite id="bdb3f"></cite></p>

                    <p id="bdb3f"><cite id="bdb3f"><th id="bdb3f"></th></cite></p><p id="bdb3f"></p>
                      <p id="bdb3f"><cite id="bdb3f"></cite></p>

                        <pre id="bdb3f"></pre>
                        <pre id="bdb3f"><del id="bdb3f"><thead id="bdb3f"></thead></del></pre>

                        <ruby id="bdb3f"><mark id="bdb3f"></mark></ruby><ruby id="bdb3f"></ruby>
                        <pre id="bdb3f"><pre id="bdb3f"><mark id="bdb3f"></mark></pre></pre><output id="bdb3f"></output><p id="bdb3f"></p><p id="bdb3f"></p>

                        <pre id="bdb3f"><del id="bdb3f"><progress id="bdb3f"></progress></del></pre>

                              <ruby id="bdb3f"></ruby>

                              哎呀哎呀视频在线观看