GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — java-coding-problems/BinaryArraySort.java at main · GitH05/java-coding-problems Expand file tree/ Copy pathBinaryArraySort.javaMore file actions 41 lines (41 loc) · 776 Bytes / Copy pathBinaryArraySort.javaFile metadata and controls41 lines (41 loc) · 776 Bytes 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 import java.util.Scanner; class BinaryArraySort { public static void main(String[] args) { int i,count=0,temp,size; System.out.print("Enter the size of the array:"); Scanner s=new Scanner(System.in); size=s.nextInt(); //implementing the binary array[example:0100110000111]: int a[]=new int[size]; System.out.println("Enter the Binary Elements: example:0100110000111"); for(i=0;i<size;i++) { a[i]=s.nextInt(); } System.out.print("\nThe Binary Elements:"); for(i=0;i<size;i++) { System.out.print(a[i]+" "); } //BinarySortArray: for(i=0;i<size;i++) { if(a[i]==0) { temp=a[i]; a[i]=a[count]; a[count]=temp; count++; } } //BInarySortArray: System.out.print("\nThe Binary Sort Array:"); for(i=0;i<size;i++) { System.out.print(a[i]+" "); } } } { 0, 1, 2, 2, 1, 0, 0, 2, 0, 1, 1, 0 } |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |