**The Program in C to sort a 1-d array using bubble sort technique** **is given below:**

```
#include <stdio.h>
void bubbleSort(int arr[], int n)
{
int i, j, temp;
for (i = 0; i < n-1; i++)
{
for (j = 0; j < n-i-1; j++)
{
if (arr[j] > arr[j+1])
{
temp = arr[j];
arr[j] = arr[j+1];
arr[j+1] = temp;
}
}
}
}
int main()
{
int arr[] = {64, 34, 25, 12, 22, 11, 90};
int n = sizeof(arr)/sizeof(arr[0]);
bubbleSort(arr, n);
printf("Sorted array: \n");
for (int i=0; i < n; i++)
printf("%d ", arr[i]);
return 0;
}
```

## Output:

Sorted array:

11 12 22 25 34 64 90

## Pro-Tips**💡**

This code first defines a function `bubbleSort()`

that takes an array and its size as input.

The function uses nested for loops to iterate through the array, comparing each pair of adjacent elements and swapping them if the first element is greater than the second.

The outer loop runs for n-1 iterations, while the inner loop runs for n-i-1 iterations, where i is the current iteration of the outer loop.

The `main()`

function then declares and initializes an array of integers, calls the `bubbleSort()`

function on that array, and prints the sorted array to the console

**Learn C-Sharp ↗**

C-sharp covers every topic to learn about C-Sharp thoroughly.

**Learn C Programming ↗**

C-Programming covers every topic to learn about C-Sharp thoroughly.

**Learn C++ Programming↗**

**Learn C++ Programming↗**

C++ covers every topic to learn about C-Sharp thoroughly.