add: DMA 10

Author: webwithaman

19_dynamic_memory_allocation/00_questions.txt

@@ -24,5 +24,4 @@ and free.
 09. Write a program to allocate memory dynamically of the size in bytes entered by the
     user. Also handle the case when memory allocation is failed.
 
-10. Find out the largest and smallest element from an array using dynamic memory allocation
-in C.
+10. Find out the largest and smallest element from an array that is created using dynamic memory allocation in C.

19_dynamic_memory_allocation/10_largest_smallest.c

@@ -0,0 +1,60 @@
+// Find out the largest and smallest element from an array that is created using dynamic memory allocation in C.
+
+// Header Files
+#include <stdio.h>
+#include <conio.h>
+#include <malloc.h>
+
+#define MAX 50
+
+// Main Function Start
+int main()
+{
+    const int n;
+    int *ptr, smallest, largest;
+    printf("\nHow Many Elements You Want to Enter (MAX %d) => ", MAX);
+    scanf("%d", &n);
+
+    // Invalid Input
+    if (n < 1 || n > MAX)
+    {
+        puts("\n!!! Invalid Input...\n");
+        exit(0);
+    }
+
+    // Allocate memory dynamically
+    ptr = (int *)malloc(n * sizeof(int));
+
+    if (!ptr)
+    {
+        puts("\nUnable to Allocate Memory Dynamically...\n");
+        exit(0);
+    }
+
+    // Input Numbers
+    printf("\nEnter %d Numbers => ", n);
+    for (int i = 0; i < n; i++)
+        scanf("%d", &ptr[i]);
+
+    smallest = largest = ptr[0];
+
+    // Find Largest and Smallest Element
+    for (int i = 1; i < n; i++)
+    {
+        if (ptr[i] > largest)
+            largest = ptr[i];
+
+        if (ptr[i] < smallest)
+            smallest = ptr[i];
+    }
+
+    printf("\nSmallest Element => %d\nLargest Element => %d", smallest, largest);
+
+    // Free Dynamically Allocated Memory
+    free(ptr);
+
+    putch('\n');
+    getch();
+    return 0;
+}
+// Main Function End