C program to accept N numbers and arrange them in an ascending order

Explanation

1. Include Header Files:

   #include <stdio.h>
   

   • This line includes the standard input-output library, which is necessary for using printf and scanf.

2. Bubble Sort Function:
   void bubbleSort(int arr[], int n) {

   • This function sorts the array arr of size n using the bubble sort algorithm.
   • The outer loop runs n-1 times, and the inner loop compares adjacent elements, swapping them if they are in the wrong order.

3. Swapping Elements:

   if (arr[j] > arr[j + 1]) {
       int temp = arr[j];
       arr[j] = arr[j + 1];
       arr[j + 1] = temp;
   }
   

   • If the current element is greater than the next one, they are swapped to move the larger element towards the end of the array.

4. Main Function:

   int main() {
   

   • The main function starts the execution of the program.

5. Input Number of Elements:

   printf("Enter the number of elements: ");
   scanf("%d", &N);
   

   • The user is prompted to enter the number of integers they want to sort, which is stored in N.

6. Dynamic Array Declaration:

   int arr[N];
   

   • An array arr of size N is declared to store the numbers.

7. Input Elements:

   for (int i = 0; i < N; i++) {
       scanf("%d", &arr[i]);
   }
   

   • A loop is used to read N integers from the user into the array.

8. Sorting the Array:

   bubbleSort(arr, N);
   

   • The bubbleSort function is called to sort the array in ascending order.

9. Display Sorted Array:

   printf("Sorted numbers in ascending order:\n");
   for (int i = 0; i < N; i++) {
       printf("%d ", arr[i]);
   }
   

   • The sorted array is printed to the console.

10. Return Statement:

    return 0;
    

    • Indicates that the program executed successfully.