I am learning Java, but i am a pythonista. So please write this code below in python. Code: public class ABC{ /* Function to reverse arr[] from start to end*/ static void rvereseArray(int arr[], int start, int end) { int temp; while (start < end) { temp = arr[start]; arr[start] = arr[end]; arr[end] = temp; start++; end--; } } /* Utility that prints out an array on a line */ static void printArray(int arr[], int size) { for (int i = 0; i < size; i++) System.out.print(arr[i] + " "); System.out.println(); } // Driver code public static void main(String args[]) { int arr[] = {1, 2, 3, 4, 5, 6}; printArray(arr, 6); rvereseArray(arr, 0, 5); System.out.print("Reversed array is \n"); printArray(arr, 6); } }

I am learning Java, but i am a pythonista. So please write this code below in python. Code: public class ABC{ /* Function to reverse arr[] from start to end/ static void rvereseArray(int arr[], int start, int end) { int temp; while (start < end) { temp = arr[start]; arr[start] = arr[end]; arr[end] = temp; start++; end--; } } / Utility that prints out an array on a line */ static void printArray(int arr[], int size) { for (int i = 0; i < size; i++) System.out.print(arr[i] + " "); System.out.println(); } // Driver code public static void main(String args[]) { int arr[] = {1, 2, 3, 4, 5, 6}; printArray(arr, 6); rvereseArray(arr, 0, 5); System.out.print("Reversed array is \n"); printArray(arr, 6); } }

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 8SA

See similar textbooks

Similar questions

Write a Java function called SpOdd, so that this function would take an array of integers as input and return an array of integers with all the odd numbers in the original array. Make sure to keep the same order as the original array and also test your function in the main function. Sample output of the main function: The original Array: [3, 8, 5, 7, 1, 9, 2] The odd elements in the array: [3, 5, 7, 1, 9]
In python, Problem Description:Sheldon and Leonard are physicists who are fixated on the BIG BANG theory. In order to exchange secret insights they have devised a code that encodes UPPERCASE words by shifting their letters forward. Shifting a letter by S positions means to go forward S letters in the alphabet. For example, shifting B by S = 3 positions gives E. However, sometimes this makes us go past Z, the last letter of the alphabet. Whenever this happens we wrap around, treating A as the letter that follows Z. For example, shifting Z by S = 2 positions gives B. Sheldon and Leonard’s code depends on a parameter K and also varies depending on the position of each letter in the word. For the letter at position P, they use the shift value of S = 3P + K. For example, here is how ZOOM is encoded when K = 3. The first letter Z has a shift valueof S = 3 × 1 + 3 = 6; it wraps around and becomes the letter F. The second letter, O, hasS = 3 × 2 + 3 = 9 and becomes X. The last two letters…
Please follow the instructions in the screenshots provided and use that to implement the code given below. Done in python 3.10 or later please. class WeightedAdjacencyMatrix : """A weighted graph represented as a matrix.""" __slots__ = ['_W'] def __init__(self, size, edges=[], weights=[]) : """Initializes a weighted adjacency matrix for a graph with size nodes. Graph is initialized with size nodes and a specified set of edges and edge weights. Keyword arguments: size -- Number of nodes of the graph. edges -- a list of ordered pairs (2-tuples) indicating the edges of the graph. The default value is an empty list which means no edges by default. weights -- a list of weights for the edges, which should be the same length as the edges list. The position of a value in the weights list corresponds to the edge in the same position of…
Java Programming- Need the code- Suppose we have a string holding the text of an entire book. If we want to analyze segments of the text, it is inefficient to make substrings. Instead, we should just store a reference to the original text and the starting and ending positions. Design a class Segment that does this, and have it implement the CharSequence interface of the standard library. Write a test program in which you demonstrate that you can pass your Segment objects to methods that accept CharSequence instances, such as String.join and PrintStream.append.
In JAVA A function foo takes three integers as input arguments, i.e., foo(int a, int b, int c). The three inputs represent the three sides of a triangle in centimeter. The function is expected to return the type of a triangle: “equilateral”, “isosceles”, or “scalene”. Assume the domains of the three variables are 1 ≤ a ≤ 100, 50 ≤ b ≤ 150 and 100 ≤ c ≤ 200, respectively. A test case is in a tuple format <a, b, c, expected_output> with test inputs and the expected output. S1 is a set of test cases for the “Boundary Value Analysis” approach. S1 = S2 is a set of test cases for the “Robustness testing” approach. S2 – S1 = S3 is a set of tests cases for the “Robust Worst-Case testing” approach. Are there any types of triangles that S3 cannot reveal? If yes, what are they? If no, why?
JAVA Program ASAP Please modify this program and take out the main method from the program so it passes the test cases in Hypergrade. I have provided the failed test cases. import java.io.BufferedReader;import java.io.FileReader;import java.io.IOException;import java.util.ArrayList;import java.util.Arrays;import java.util.InputMismatchException;import java.util.Scanner;public class FileSorting { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); while (true) { System.out.println("Please enter the file name or type QUIT to exit:"); String fileName = scanner.nextLine(); if (fileName.equalsIgnoreCase("QUIT")) { break; } try { ArrayList<String> lines = readFile(fileName); if (lines.isEmpty()) { System.out.println("File " + fileName + " is empty."); } else { performSorting(lines);…
Write a program called Recursive_fibonacci.java that implements a recursive function for computing the nth term of a Fibonacci Sequence. In the main method of your program accept the value of n from the user as a command-line argument and then call your function named Fibonacci with this value. The output should look exactly like what is pictured below.
write a python prgram (oop)Implement the design of the Groceries and Buyer classes so that the following code generates the output below: #Write your code herebuyer1 = Buyer('Ross', 'CL23')print('1.===============================')print(buyer1)item1 = Groceries('Mango', 'Fruits')print('2.===============================')print(item1)print('3.===============================')print(Groceries.items)print('4.===============================')Groceries.add_items('Packaged',['Flour 90', 'Noodles 30', 'Soybean-Oil 150'])print(f'Updated Item List:\n{Groceries.items}')print('5.===============================')item2 = Groceries('Flour', 'Packaged', 3)print(item2)print('6.===============================')buyer1.create_bill(item1, item2)print('7.===============================')item3 = Groceries('Orange', 'Fruits', 3)print(item3)print('8.===============================')item4 = Groceries('Rice', 'Packaged', 2)print(item4)print('9.===============================')buyer2 =…
Consider the following C function or Java method (except for final printstatement the code is the same):void fun (int x) {int a, b, c, d;d = 1;for (a = 1 ; a <= x ; a ++) {b = a;c = 1;while (b > 0) {c &= b % 2;b /= 2;}d += c;}printf ("%d\n", d);}void fun (int x) {int a, b, c, d;d = 1;for (a = 1 ; a <= x ; a ++) {b = a;c = 1;while (b > 0) {c &= b % 2;b /= 2;}d += c;}System.out.println (d);} (a) What output will be printed for input value x = 8 ?(b) How many dierent input values x cause the function to print theresult 8 ?(c) Write a function with the same behavior but only one loop (of anytype) and no library call except for the print statement.
Rock-paper-scissors is a game for two players. Each player chooses an action without knowledge ofthe other’s choice. If the players choose the same action then there is a draw. Otherwise the winneris determined by the following rules: paper beats rock, rock beats scissors, and scissors beats paper. you are going to make a playable Rock-Paper-Scissors game and consider multiplayer tournaments. • Please make it a single Haskell file • Please put comments in your code to show which question you are answering with each piece ofcode. • You may create auxiliary functions if you like. You may use library functions from Haskell’sstandard library.• Please limit your line lengths to 100 characters max.Please use the following two data types which you can copy-and-paste into your code.data Action = Rock | Paper | Scissors deriving (Eq, Show)data Outcome = Player1Win | Player2Win | Draw deriving ShowAction represents a player’s chosen action and Outcome represents the outcome of playing a game
THIS NEEDS TO BE DONE IN C#! NOT JAVA! NOT C++, NOT PYTHON! PLEASE WRITE THIS IN C#! Take the following class: class Pokemon { string Name; string Type; int Health; } Override the ToString method so that it it outputs the Pokemon's heath. Example: Let's say we have a Pikachu named Sparky and it had 200 health. When we called ToString, we would get the following string: Rex: Pikachu (200)
Write the Java program: Make sure to have proper code indentation. Code: class Main { public static void main(String[] args) { Tile t1, t2, t3, t4, t5; int totalValue; t1 = new Tile('H', 4); t2 = new Tile('E', 1); t3 = new Tile('L', 1); t4 = new Tile('L', 1); t5 = new Tile('O', 1); totalValue = t1.getValue() + t2.getValue() + t3.getValue() + t4.getValue() + t5.getValue(); System.out.print("The word "); System.out.print(t1.getLetter()); System.out.print(t2.getLetter()); System.out.print(t3.getLetter()); System.out.print(t4.getLetter()); System.out.print(t5.getLetter()); System.out.println(" is worth " + totalValue + " points"); if(t4.equals(t3)) { System.out.print("It has two of these: "); System.out.println(t4); } else { System.out.print("Error: " + t3.toString() + " and ");System.out.println(t4.toString() + " aren't equal."); } }} /* SAMPLE OUTPUT The word HELLO is worth 8 pointsIt…