#include <stdio.h> #include <stdlib.h> #include <iostream> using namespace std; #define RWS 5 #define CLS 4 int cmpr(void const *a, void const *b) { // to sort descending order int n = *((int*)a), m = *((int*)b); return (n > m ? -1 : n==m ? 0 :1 ); } void pr_arr(char* msg, int arr[]) { cout<<endl<<msg<<endl; for (int i=0; i<RWS*CLS;i++) cout << arr[i] <<", "; cout<<endl; } int main() { int arr[RWS][CLS] = { 65, 23, 88, 9, 8, 25, 42, 12, 9, 98, 55, 16, 8, 67, 9, 45, 6, 28, 76, 8 }; pr_arr("Array before sorting",(int*)arr); qsort( arr, RWS*CLS, sizeof(int), cmpr); pr_arr("Array after sorting:",(int*)arr); int *p_arr = (int*)arr; int i=1, found = 0; for (i; i<RWS*CLS; i++) if ( *(p_arr + i) == *(p_arr + i-1) ) { std::cout << "\nMaximum number with more than one ocurance in array = " << *(p_arr+i)<<endl; found++; break; } if (!found) std::cout << endl << "No repeated numers in array" << endl; return 0; } |