sadhanaj28
BAN USERit is working fine for odd number of integers in array but not for even . Can any one tell me, What is wrong with this???
- sadhanaj28 March 21, 2015public class BetwnGr{
public static void main(String [] args){
int [] arr= { 10, 12, 20, 80, 100 };
arr=incr(arr);
int l=arr.length;
int m=l/2;
int j=1,k=m+1;
for(int i=1;i<=m;i++){
int temp=arr[j];
arr[j]=arr[k];
for(int p=k;p>j+1;p--){
arr[p]=arr[p-1];
}
arr[j+1]=temp;
j+=2;
k+=1;
}
System.out.println("\nArry");
for(int r=0;r<arr.length;r++)
System.out.print(" "+arr[r]);
}
public static int [] incr(int [] a){
for(int i=0;i<a.length;i++){
int k=a[i];
int loc=i;
for(int j=i+1;j<a.length;j++){
if(k>a[j]){
k=a[j];
loc=j;
}
}
if(k!=a[i]){
a[loc]=a[i];
a[i]=k;
}
}
return a;
}
}
import java.util.Scanner;
public class MatrixDic{
static char a[][]= { {'r','o','h','d','n'},
{'b','o','x','a','p'},
{'a','r','h','a','c'},
{'r','o','h','a','n'},
{'r','m','j','i','o'} };
public static void main(String []args){
Scanner in=new Scanner(System.in);
String str=in.nextLine();
int f=0;
for(int i=0;i<5;i++){
for(int j=0;j<5;j++){
if(a[i][j]==str.charAt(0))
f=find(i,j,str);
if(f==1){
break;
}
}
}
if(f==0)
System.out.print("false");
else{
System.out.print("true");
}
}
public static int find(int i,int j,String str){
int k=1;
int fl=0;
//row forword
for(;k<str.length();k++){
j++;
if(j<5){
if(a[i][j]==str.charAt(k))
fl=1;
else
fl=0;
}
}
//row backword
if(fl==0){
for(;k<str.length();k++){
j--;
if(j>=0){
if(a[i][j]==str.charAt(k))
fl=1;
else
fl=0;
}
}
}
//col forword
if(fl==0){
for(;k<str.length();k++){
i++;
if(i<5){
if(a[i][j]==str.charAt(k))
fl=1;
else
fl=0;
}
}
}
// col backword
if(fl==0){
for(;k<str.length();k++){
i--;
if(i>=0){
if(a[i][j]==str.charAt(k))
fl=1;
else
fl=0;
}
}
}
//dia forword
if(fl==0){
for(;k<str.length();k++){
j++; i++;
if(j<5&&i<5){
if(a[i][j]==str.charAt(k))
fl=1;
else
fl=0;
}
}
}
//dia backword
if(fl==0){
for(;k<str.length();k++){
j--;i--;
if(i>=0&&j>=0){
if(a[i][j]==str.charAt(k))
fl=1;
else
fl=0;
}
}
}
return fl;
}
}
public class StrCount{
public static void main(String []args){
String str="aaawwrrrvfuuk";
String str2="";
int n=0;
for(int i=0;i<str.length();i++){
char c=str.charAt(i);
if(i==0){
str2=""+c;
}
if(c==str2.charAt(str2.length()-1)){
n++;
}
else{
if(n>1)
str2=str2+n;
str2=str2+c;
n=1;
}
}
System.out.println(str2);
}
}
This code is using O(n*m)complexity. row is n, col is m.
if i m wrong, than plz, correct me.
public class Matrix1{
public static void main(String []args){
int [][] m=new int[][]{
{ 20, 40, 80 },
{ 5, 60, 90 },
{ 45, 50, 55 } };
int i=0,j=1,k=2,a=0,b=0,c=0;
for(int p=0;p<9;p++){
if(c<3&&a<3&&b<3){
if(m[i][a]<m[j][b]&&m[i][a]<m[k][c]){
System.out.print(m[i][a]+" , ");
a++;
if(c==3)
mass(m,j,b,k,c,p);
}
else if(m[j][b]<m[i][a]&&m[j][b]<m[k][c]){
System.out.print(m[j][b]+" , ");
b++;
if(c==3)
mass(m,i,a,k,c,p);
}
else if(m[k][c]<m[j][b]&&m[k][c]<m[i][a]){
System.out.print(m[k][c]+" , ");
c++;
if(c==3)
mass(m,i,a,j,b,p);
}
}
}
}
public static void mass(int arr[][],int i,int a,int j,int b,int p){
int l=9-p;
for(int e=0;e<l;e++){
if(a==3&&b!=3){
System.out.print(arr[j][b]+" , "); b++;
}
if(b==3&&a!=3){
System.out.print(arr[i][a]+" , "); a++;
}
if(a!=3&&b!=3){
if(arr[i][a]<arr[j][b]){
System.out.print(arr[i][a]+" , ");
a++;
}
else{
System.out.print(arr[j][b]+" , ");
b++;
}
}
}
}
}
This code is good for only this array. It's not working for other
public class MissN{
static int l=0;
public static void main(String [] args){
int [] arr={1,2,4,5,6,8};
int n=8;
int m=2;
findM(arr,0,5);
}
public static void findM(int [] arr,int i,int k){
int x=i+1;
if((arr[x]-arr[i])==1){
if(k!=x){
int j=(i+k)/2;
if(x!=j)
findM(arr,x,j);
findM(arr,j,j+1);
int s=j+1;
if(s!=k)
findM(arr,s,k);
}
else
return;
}
else{
int p=arr[i]+1;
System.out.print(" "+p);
l=l+1;
}
if(l==2)
return;
if(x==k)
return;
}
}
public class Dice{
public static void main(String [] args){
int A[]=new int[9];
int k=0;
for(int i=1;i<=3;i++){
for(int j=1;j<=3;j++){
A[k]=i+j;
k++;
}
}
System.out.println("--- Output ---");
for(int i=1;i<=6;i++){
int m=0;
for(int j=0;j<9;j++){
if(i==A[j])
m++;
}
System.out.print(" "+i+" times : "+m);
}
}
}
- sadhanaj28 March 23, 2015