Database System Concepts
7th Edition
ISBN: 9780078022159
Author: Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher: McGraw-Hill Education
expand_more
expand_more
format_list_bulleted
Question
6.28 LAB: Check if array is sorted
Use java Programming
Write the inOrder() method, which has an array of integers as a parameter, and returns true if the numbers are sorted (in order from low to high) or false otherwise. The program outputs "In order" if the array is sorted, or "Not in order" if the array is not sorted.
Ex: If the array passed to the inOrder() method is [5, 6, 7, 8, 3], then the method returns false and the program outputs:
Not in orderEx: If the array passed to the inOrder() method is [5, 6, 7, 8 , 10], then the method returns true and the program outputs:
In orderpublic class LabProgram {
public static boolean inOrder(int [] nums) {
/* Type your code here. */
}
public static void main(String[] args) {
// Test out-of-order example.
int [] nums1 = {5, 6, 7, 8, 3};
if(inOrder(nums1)){
System.out.println("In order");
}else{
System.out.println("Not in order");
}
// Test in-order example.
int [] nums2 = {5, 6, 7, 8, 10};
if(inOrder(nums2)){
System.out.println("In order");
}else{
System.out.println("Not in order");
}
}
}
public static boolean inOrder(int [] nums) {
/* Type your code here. */
}
public static void main(String[] args) {
// Test out-of-order example.
int [] nums1 = {5, 6, 7, 8, 3};
if(inOrder(nums1)){
System.out.println("In order");
}else{
System.out.println("Not in order");
}
// Test in-order example.
int [] nums2 = {5, 6, 7, 8, 10};
if(inOrder(nums2)){
System.out.println("In order");
}else{
System.out.println("Not in order");
}
}
}
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution
Trending nowThis is a popular solution!
Step by stepSolved in 4 steps with 2 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.Similar questions
- Give me correct code. Downvote for incorrect and copied code. Changes in function..arrow_forward9. Write function getMoveRow to do the following a. Return type integer b. Parameter list i. 1-d character array (i.e. move), size 3 c. Convert the row portion of the player’s move to the associated integer index for the board array d. Example: i. move = ‘b2’ ii. 2 is the row iii. 2 is index 1 in the board array e. Return the row array index that corresponds to the player’s move f. Return a -1 if the row is not valid (i.e. INVALID) 10. Write function getMoveCol to do the following a. Return type integer b. Parameter list i. 1-d character array (i.e. move), size 3 c. Convert the column portion of the player’s move to the associated integer index for the board array d. Example: i. move = ‘b2’ ii. b is the column iii. b is index 1 in the board array e. Return the column array index that corresponds to the player’s move f. Return a -1 if the column is not valid (i.e. INVALID) I am getting an error when entering the code at the very end. please fix it. This is the code in C int…arrow_forward30arrow_forward
- Implement an empty integer array of capacity 5. a) Use a loop to input values from the console into the array. b) Use a loop to determine the smallest element in the array. c) Use a loop to determine the largest element in the array. d) Use a loop to output the array. e) Output the smallest and largest elements. Example Output [0] = 4 [1] = 24 [2] = 123 [3] = 54 [4] = 3 Array: 4 24 123 54 3 Max: 123 Min: 3 programming language is c++ pleasw do it in a easy wayarrow_forward17: recursion.cpp) Write two recursive integer functions. The first function should calculate factorials using the definition 0! = 1 and n! = (n-1)! x n. In addition, if n is too large it should be able to detect integer overflow before it happens. The next function should calculate the greatest common factor (gcf) of two numbers. If the second number is zero, then the gcf is the other number. Otherwise, the gcf of a and b is the same as the gcf of b and a mod b.arrow_forwardpython: numpy def coupons(my_list, on_sale, prices): ''' QUESTION 5 It's the time of week to go grocery shopping again! Given three arrays, one of what's on sale, one of your own list, and one of the prices, return an array of the items on your list that are on sale and more than five dollars. You have MORE coupons than you have groceries on your list- make sure to only use the coupons that correspond to your list. THIS MUST BE DONE IN ONE LINE Hint: use masking and slicing Args: my_list(np.array) on_sale(np.array) prices(np.array) Return: np.array >>> my_list = np.array(["eggs", "2% milk", "green onions", "whole wheat bread", "onions", "spinach", "peanut butter", "boxed spaghetti", "salt and vinegar chips", "alfredo sauce"]) >>> on_sale = np.array([True, False, True, True, True, True, False, False, False, True, False, True, False])…arrow_forward
arrow_back_ios
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
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