Merge pull request csubhasundar#223 from kritikasharma4/main

Insertion sort and maxm value in array in cpp

Author: sherigar

insertalgo.py

@@ -0,0 +1,17 @@
+def insertionSort(arr):
+    n = len(arr)  
+      
+    if n <= 1:
+        return   
+ 
+    for i in range(1, n):  
+        key = arr[i] 
+        j = i-1
+        while j >= 0 and key < arr[j]:  
+            arr[j+1] = arr[j]  
+            j -= 1
+        arr[j+1] = key  
+  
+arr = [12, 11, 13, 5, 6]
+insertionSort(arr)
+print(arr)

maxnum.cpp

@@ -0,0 +1,21 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+void solve(){
+    int n;
+    cin>>n;
+    int arr[n];
+    for(int i=0;i<n;i++){
+        cin>>arr[i];
+    }
+    int mx=INT32_MIN;
+    for(int i=0;i<n;i++){
+        mx=max(mx,arr[i]);
+    }
+    cout<<mx<<endl;
+}
+
+int main() {
+  solve();
+  return 0;
+}