Ttykuu

What was required to accept "troll"?

Can a Bard use an arcane focus?

Is there an wasy way to program in Tikz something like the one in the image?

Did US corporations pay demonstrators in the German demonstrations against article 13?

Invariance of results when scaling explanatory variables in logistic regression, is there a proof?

Calculating the number of days between 2 dates in Excel

Partial sums of primes

Can I use my Chinese passport to enter China after I acquired another citizenship?

Science Fiction story where a man invents a machine that can help him watch history unfold

For airliners, what prevents wing strikes on landing in bad weather?

The One-Electron Universe postulate is true - what simple change can I make to change the whole universe?

Superhero words!

Indicating multiple different modes of speech (fantasy language or telepathy)

Word describing multiple paths to the same abstract outcome

Greatest common substring

Are taller landing gear bad for aircraft, particulary large airliners?

Is there enough fresh water in the world to eradicate the drinking water crisis?

A known event to a history junkie

Reply ‘no position’ while the job posting is still there (‘HiWi’ position in Germany)

Does "Dominei" mean something?

What to do when my ideas aren't chosen, when I strongly disagree with the chosen solution?

What is the term when two people sing in harmony, but they aren't singing the same notes?

What if somebody invests in my application?

Simulating a probability of 1 of 2^N with less than N random bits

Divide an array into two parts

Racing Java Arrays.sort with NON recursive Merge Sort implementationPerforming several integer division operations on an arrayHackerrank's Sherlock and ArrayLeetCode Rotate ArrayFinding an equilibrium index in an int arrayCode that prints ASCII bowties to screen given inputsRearranging an array such that positive and negative elements are at alternate positions“Ease the Array” challengeSort an array of 0s, 1s and 2s in JavaSubset Sums in Java

0

$begingroup$

I am trying to divide an array into 2 equal parts. below code is working fine as given input ->> int arr[] = 1,2,3,4,5,6,7,8,9,10; for even number of array elements but in odd number of input elements.

Q1 - One index is missing when inputs are odd (Size of array is odd).

Q2 - I want to improve complexity of this program

public class DivideArray 
 public static void main(String[] args) 
 int arr[] = 1,2,3,4,5,6,7,8,9,10;
 int len = arr.length;
 int arr1[]= new int[(len/2)+1];
 int arr2[] = new int[(len/2)+1];
 for(int i=0;i<arr.length;i++)
 if(((len/2))>i)
 arr1[i] = arr[i];
 
 else
 arr2[(arr.length-i)-1] = arr[i];
 
 
 //First half array
 System.out.println("First half array");
 for(int i=0;i<arr.length/2;i++)
 System.out.print(" " + arr1[i]);
 
 //Second half array
 System.out.println();
 System.out.println("Second half array");
 for(int i=arr.length/2-1;i>=0;i--)
 System.out.print(" " + arr2[i]);
 
 

java array

share

asked 9 mins ago

Ved PrakashVed Prakash

1013

New contributor

Ved Prakash is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Please explain this arr2[(arr.length-i)-1] = arr[i];
  $endgroup$
  – Mukul Kumar
  1 min ago
  

  
  
  
  

add a comment | 

0

$begingroup$

I am trying to divide an array into 2 equal parts. below code is working fine as given input ->> int arr[] = 1,2,3,4,5,6,7,8,9,10; for even number of array elements but in odd number of input elements.

Q1 - One index is missing when inputs are odd (Size of array is odd).

Q2 - I want to improve complexity of this program

public class DivideArray 
 public static void main(String[] args) 
 int arr[] = 1,2,3,4,5,6,7,8,9,10;
 int len = arr.length;
 int arr1[]= new int[(len/2)+1];
 int arr2[] = new int[(len/2)+1];
 for(int i=0;i<arr.length;i++)
 if(((len/2))>i)
 arr1[i] = arr[i];
 
 else
 arr2[(arr.length-i)-1] = arr[i];
 
 
 //First half array
 System.out.println("First half array");
 for(int i=0;i<arr.length/2;i++)
 System.out.print(" " + arr1[i]);
 
 //Second half array
 System.out.println();
 System.out.println("Second half array");
 for(int i=arr.length/2-1;i>=0;i--)
 System.out.print(" " + arr2[i]);
 
 

java array

share

asked 9 mins ago

Ved PrakashVed Prakash

1013

New contributor

Ved Prakash is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Please explain this arr2[(arr.length-i)-1] = arr[i];
  $endgroup$
  – Mukul Kumar
  1 min ago
  

  
  
  
  

add a comment | 

$begingroup$

I am trying to divide an array into 2 equal parts. below code is working fine as given input ->> int arr[] = 1,2,3,4,5,6,7,8,9,10; for even number of array elements but in odd number of input elements.

Q1 - One index is missing when inputs are odd (Size of array is odd).

Q2 - I want to improve complexity of this program

public class DivideArray 
 public static void main(String[] args) 
 int arr[] = 1,2,3,4,5,6,7,8,9,10;
 int len = arr.length;
 int arr1[]= new int[(len/2)+1];
 int arr2[] = new int[(len/2)+1];
 for(int i=0;i<arr.length;i++)
 if(((len/2))>i)
 arr1[i] = arr[i];
 
 else
 arr2[(arr.length-i)-1] = arr[i];
 
 
 //First half array
 System.out.println("First half array");
 for(int i=0;i<arr.length/2;i++)
 System.out.print(" " + arr1[i]);
 
 //Second half array
 System.out.println();
 System.out.println("Second half array");
 for(int i=arr.length/2-1;i>=0;i--)
 System.out.print(" " + arr2[i]);
 
 

java array

share

asked 9 mins ago

Ved PrakashVed Prakash

1013

New contributor

Ved Prakash is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

public class DivideArray 
 public static void main(String[] args) 
 int arr[] = 1,2,3,4,5,6,7,8,9,10;
 int len = arr.length;
 int arr1[]= new int[(len/2)+1];
 int arr2[] = new int[(len/2)+1];
 for(int i=0;i<arr.length;i++)
 if(((len/2))>i)
 arr1[i] = arr[i];
 
 else
 arr2[(arr.length-i)-1] = arr[i];
 
 
 //First half array
 System.out.println("First half array");
 for(int i=0;i<arr.length/2;i++)
 System.out.print(" " + arr1[i]);
 
 //Second half array
 System.out.println();
 System.out.println("Second half array");
 for(int i=arr.length/2-1;i>=0;i--)
 System.out.print(" " + arr2[i]);
 
 

share

asked 9 mins ago

Ved PrakashVed Prakash

1013

New contributor

Ved Prakash is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

share

asked 9 mins ago

Ved PrakashVed Prakash

1013

New contributor

Ved Prakash is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

asked 9 mins ago

Ved PrakashVed Prakash

1013

New contributor

Ved Prakash is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

asked 9 mins ago

Ved PrakashVed Prakash

1013