int maxOnes(int arr[n][n])
{
int maxOnesRow = 0;
int i=j=0;
while( i<n && j<n ) {
if (arr[i][j]) {
j++;
}
else {
maxOnesRow = i++;
}
return maxOnesRow;
}
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To view this discussion on the web visit
https://groups.google.com/d/msg/algogeeks/-/lEocC6J8ZrAJ.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
