Functions and arrays

Web/Archi24_ArchiMittal_2024it1052_2/2DArrays/demo.cpp

@@ -0,0 +1,24 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main() {
+     int n,m;
+     cin>>n>>m;
+     int i,arr[10][10],j;
+     for(i=0;i<n;i++)
+     {
+         for(j=0;j<m;j++)
+         {
+             cin>>arr[i][j];
+         }
+     }
+     for(i=0;i<n;i++)
+     {
+         for(j=0;j<m;j++)
+         {
+             cout<<arr[i][j]<<" ";
+         }
+             cout<<endl;
+
+     }
+     return 0;
+}

Web/Archi24_ArchiMittal_2024it1052_2/function_and_arrays/anybasetodecimal.cpp

@@ -0,0 +1,33 @@
+#include <iostream>
+#include <cmath>
+using namespace std;
+int DecToAny(int n, int b)
+{
+    int r,rev=0,c=0;
+    while(n!=0)
+    {
+        r=n%10;
+        if(r!=0)
+        {
+        rev=rev+(r*(pow(b,c)));
+        c++;
+        }
+        else
+        {
+            c++;
+        }
+        n=n/10;
+
+    }
+
+   // return c;
+   return rev;
+}
+int main() {
+  int n;
+  int b;
+  cin >> n;
+  cin >> b;
+  int res = DecToAny(n, b);
+  cout << res << endl;
+}

Web/Archi24_ArchiMittal_2024it1052_2/function_and_arrays/decimaltoanybase.cpp

@@ -0,0 +1,43 @@
+#include<iostream>
+#include <cstdio>
+using namespace std;
+
+
+void convert10tob(int N, int b)
+{
+     if (N == 0)
+        return;
+     int x = N % b;
+     N /= b;
+     if (x < 0)
+        N += 1; 
+     convert10tob(N, b);
+
+     if(x<0)
+     {
+        cout<<x + (b * -1);
+     }
+     else
+     {
+         cout<<x;
+     }
+     return;
+}
+
+
+int main()
+{
+    int N,b;
+
+    cin>>N;
+
+    cin>>b;
+    if (N != 0)
+    {
+        convert10tob(N, b);
+        cout<<endl;
+    }
+    else
+        cout<<"0"<<endl;
+    return 0;
+}

Web/Archi24_ArchiMittal_2024it1052_2/function_and_arrays/digitfrequency.cpp

@@ -0,0 +1,21 @@
+#include<iostream>
+using namespace std;
+int digFreq(int n, int d) {
+    int r,c=0;
+  while(n>0)
+  {
+    r=n%10;
+    if(r==d)
+    {
+        c++;
+    }
+    n=n/10;
+  }
+  return c;
+}
+int main() {
+  int n, d;
+  cin >> n >> d;
+  int res = digFreq(n, d);
+  cout << res << endl;
+}

Web/Archi24_ArchiMittal_2024it1052_2/function_and_arrays/findelement.cpp

@@ -0,0 +1,30 @@
+#include<iostream>
+using namespace std;
+int find(int arr[],int n,int d)
+{
+    int i;
+    for(i=0;i<n;i++)
+    {
+        if(arr[i]==d)
+        {
+            return i;
+        }
+
+    }
+    return -1; 
+}
+
+int main(){
+    int n,arr[100],i,flag=0,c;
+    cin>>n;
+    for(i=0;i<n;i++)
+    {
+        scanf("%d",&arr[i]);
+    }
+    int d;
+    cin>>d;
+    int g;
+    g=find(arr,n,d);
+    cout<<g;
+  return 0;  
+}

Web/Archi24_ArchiMittal_2024it1052_2/function_and_arrays/reversearray.cpp

@@ -0,0 +1,17 @@
+#include<iostream>
+using namespace std;
+
+int main()
+{
+    int i,arr[100],n;
+    cin>>n;
+    for(i=0;i<n;i++)
+    {
+        scanf("%d",&arr[i]);
+    }
+    for(i=n-1;i>=0;i--)
+    {
+        cout<<arr[i]<<" " ;
+    }
+    return 0;
+}

Web/Archi24_ArchiMittal_2024it1052_2/function_and_arrays/rotatearray.cpp

@@ -0,0 +1,38 @@
+
+#include<iostream>
+using namespace std;
+void rotate(int arr[],int n)
+{
+    int i,l;
+       l=arr[n-1];
+       for(i=n-1;i>=0;i--)
+       {
+           arr[i]=arr[i-1];
+       }
+       arr[0]=l;
+
+}
+
+
+
+int main()
+{
+    int n,k,i,arr[100];
+    {
+        cin>>n;
+        for(i=0;i<n;i++)
+        {
+             scanf("%d",&arr[i]);
+        }
+       cin>>k;
+       for(i=0;i<k;i++)
+       {
+           rotate(arr,n);
+       }
+       for(i=0;i<n;i++)
+       {
+           cout<<arr[i]<<" ";
+       }
+    }
+    return 0;
+}

Web/Archi24_ArchiMittal_2024it1052_2/function_and_arrays/span.cpp

@@ -0,0 +1,40 @@
+#include<iostream>
+using namespace std;
+int max(int n, int arr[])
+{
+    int i,max=arr[0];
+    for(i=0;i<n;i++)
+    {
+        if(max<arr[i])
+        {
+            max=arr[i];
+        }
+    }
+    return max;
+}
+int min(int n,int arr[])
+{
+    int i,min=arr[0];
+    for(i=0;i<n;i++)
+    {
+        if(min>arr[i])
+        {
+            min=arr[i];
+        }
+    }
+    return min;
+}
+int main(){
+    int n,arr[10000];
+    cin>>n;
+    int i;
+    for(i=0;i<n;i++)
+    {
+        scanf("%d",&arr[i]);
+    }
+    int f,g;
+    f=max(n,arr);
+    g=min(n,arr);
+    int span=f-g;
+    cout<<span;
+}