(IN JAVA) run this code public static void main(String[] args) { Scanner input = new Scanner(System.in); System.out.print("Enter the size of the array(between 2 - 10):"); int n = input.nextInt(); int arr[] = new int[n]; System.out.print("Enter elements into the array: "); for (int i = 0; i < n; i++) { arr[i] = input.nextInt(); System.out.println(Arrays.toString(arr)); System.out.println(isSplitPoint(arr)); } } public static boolean isSplitPoint(int arr[]) { int n = arr.length; int lsum = 0; for (int i = 0; i < n; i++) { lsum += arr[i]; int rSum = 0; for (int j = i + 1; j < n; j++) rSum += arr[j]; if (lsum == rSum) ; return true; } return false; } }
(IN JAVA) run this code public static void main(String[] args) { Scanner input = new Scanner(System.in); System.out.print("Enter the size of the array(between 2 - 10):"); int n = input.nextInt(); int arr[] = new int[n]; System.out.print("Enter elements into the array: "); for (int i = 0; i < n; i++) { arr[i] = input.nextInt(); System.out.println(Arrays.toString(arr)); System.out.println(isSplitPoint(arr)); } } public static boolean isSplitPoint(int arr[]) { int n = arr.length; int lsum = 0; for (int i = 0; i < n; i++) { lsum += arr[i]; int rSum = 0; for (int j = i + 1; j < n; j++) rSum += arr[j]; if (lsum == rSum) ; return true; } return false; } }
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
(IN JAVA)
run this code
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
System.out.print("Enter the size of the array(between 2 - 10):");
int n = input.nextInt();
int arr[] = new int[n];
System.out.print("Enter elements into the array: ");
for (int i = 0; i < n; i++) {
arr[i] = input.nextInt();
System.out.println(Arrays.toString(arr));
System.out.println(isSplitPoint(arr));
}
}
public static boolean isSplitPoint(int arr[]) {
int n = arr.length;
int lsum = 0;
for (int i = 0; i < n; i++) {
lsum += arr[i];
int rSum = 0;
for (int j = i + 1; j < n; j++)
rSum += arr[j];
if (lsum == rSum) ;
return true;
}
return false;
}
}
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 5 steps with 3 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education