You can cast pointer to the first row of a two-dimensional array to pointer to int and sort the array as a one-dimensional array. Here you are #include <iostream> #include <iomanip> #include <cstdlib> #include <ctime> void bubble_sort( int *a, size_t n ) { for ( size_t last /* = n */; not ( n < … Read more
Try this: void bubble_sort(int m, int a[100000]) { int i, ok = 0, v, n = m; while ( !ok ) { ok = 1; for ( i=0; i < m-1; ++i ) { if ( *(a+i) > *(a+i+1) ) { v = *(a+i); *(a+i) = *(a+i+1); *(a+i+1) = v; ok = 0; } } … Read more
You can do this, the only difference being the condition used is the length of the array instead of an individual value. n = len(arr) for i in range(n): for j in range(n-i-1): if len(arr[j]) > len(arr[j+1]): arr[j], arr[j+1] = arr[j+1], arr[j] 2 solved How do i sort a 2D array or multiple arrays by … Read more
You are not using bubble sort. this is a selection sort algorithm and your code is not correct. I have updated the code for the bubble sort algorithm. #include <stdio.h> #include <stdlib.h> #include <time.h> int main() { int ctr, inner, outer, didSwap, temp; int nums[10]; time_t t; srand(time(&t)); for (ctr = 0; ctr < 10; … Read more