Advertisement
Guest User

Untitled

a guest
Oct 21st, 2014
152
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.60 KB | None | 0 0
  1. public static leggyakoribb keres(int [][]t)
  2. {
  3. int m=0; int n=0; int elem=0;
  4. int max=0;
  5. for(int i=0;i<t.length;i++)
  6. {for(int j=0;j<t.length;j++)
  7. {int vizsgalt=t[i][j];
  8. int gyakori=0;
  9. for(i=0;i<t.length;i++)
  10. {for(j=0;j<t[i].length;j++)
  11. {if(vizsgalt==t[i][j])
  12. gyakori++;}}
  13. if(gyakori>max)
  14. {max=gyakori;
  15. elem=vizsgalt;
  16. m=i;
  17. n=j;}}
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement