gsksandy
BAN USERThis will give the exact solution:
public class Starprint{
public void printOddNumberPattern (int x){
int d=(x+1)/2;
if(x%2 != 0){
for(int i=1;i<=x;i++){
for(int j=1;j<=x;j++){
if((i<d && i>=j) || (i>d && i<=j) )
System.out.print("*");
}
if(i == (x+1)/2){
for (int k=0;k<x;k++)
System.out.print("*");
}
System.out.print("\n");
}
}
}
public static void main(String []args){
Starprint sp= new Starprint();
sp.printOddNumberPattern(7);
}
}
public class MyQuickSort {
private int array[];
private int length;
public void sort(int[] inputArr) {
if (inputArr == null || inputArr.length == 0) {
return;
}
this.array = inputArr;
length = inputArr.length;
quickSort(0, length - 1);
}
private void quickSort(int lowerIndex, int higherIndex) {
int i = lowerIndex;
int j = higherIndex;
// calculate pivot number, I am taking pivot as middle index number
int pivot = array[lowerIndex+(higherIndex-lowerIndex)/2];
// Divide into two arrays
while (i <= j) {
/** * In each iteration, we will identify a number from left side which
* is greater then the pivot value, and also we will identify a number
* from right side which is less then the pivot value. Once the search
* is done, then we exchange both numbers. */
while (array[i] > pivot) {
i++;
}
while (array[j] < pivot) {
j--;
}
if (i <= j) {
exchangeNumbers(i, j);
//move index to next position on both sides
i++;
j--;
}
}
// call quickSort() method recursively
if (lowerIndex < j)
quickSort(lowerIndex, j);
if (i < higherIndex)
quickSort(i, higherIndex);
}
private void exchangeNumbers(int i, int j) {
int temp = array[i];
array[i] = array[j];
array[j] = temp;
}
public static void main(String a[]){
MyQuickSort sorter = new MyQuickSort();
int[] input = {24,2,45,20,0,75,2,0,99,53,12};
sorter.sort(input);
for(int i:input){
System.out.print(i);
System.out.print(" ");
}
}
}
This is one of the solution:
- gsksandy April 24, 2014