Divide an array into two parts
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
asked 5 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$
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
asked 5 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$
add a comment |
0
0
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
asked 5 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$
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
java array
asked 5 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 5 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 5 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 5 mins ago
Ved PrakashVed Prakash
1013
asked 5 mins ago
Ved PrakashVed Prakash
1013
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.
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.
Ved Prakash is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["\$", "\$"]]);
});
});
}, "mathjax-editing");
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "196"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Ved Prakash is a new contributor. Be nice, and check out our Code of Conduct.
draft saved
draft discarded
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f216212%2fdivide-an-array-into-two-parts%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Ved Prakash is a new contributor. Be nice, and check out our Code of Conduct.
draft saved
draft discarded
Ved Prakash is a new contributor. Be nice, and check out our Code of Conduct.
Ved Prakash is a new contributor. Be nice, and check out our Code of Conduct.
Ved Prakash is a new contributor. Be nice, and check out our Code of Conduct.
Thanks for contributing an answer to Code Review Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
draft saved
draft discarded
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f216212%2fdivide-an-array-into-two-parts%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
