while(p1<=mid) tmp[k++]=a[p1++];//
while(p2<=right) tmp[k++]=a[p2++];
for (int i = left; i <=right; i++)
a[i]=tmp[i];
}
public void mergeSort(int [] a.int start.int end){
if(start<end){
int mid=(start+end)/2;//
mergeSort(a, start, mid, end);//
mergeSort(a, mid+1, end);//
merge(a, start, mid, end);//
}
}
public static void main(String[] args){
GuiSort zzz=new GuiSort();
int[] a = {49 38 65 97 76 13 27 50 };
zzz.mergeSort(a, 0, a.length-1);
System.out.print(e+"");
}
]
import java.util.*;
/**
*Author:
*Description:
*Date
*Modifid By:
*/
public class EmptyTrl {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
System.out.println();
int num=sc.nextInt();
for(int i=0; i<num-1;i++){
for(int i=0;i<num-1-i;j>0;j--){
System.out.print("");
}