I have an assignment and one of the prompts is to do a binary search on an array if and only if the array of Strings is sorted. The binary search part I think I have completed, but it is the sorted array check that is throwing everything off. If the array is already sorted, return true; else, return false.
// Check if the array is sorted
public static boolean isSorted(String[] arr) {
//for (int i = 0; i < arr.length-1; i++)
//{
//if (arr[i].compareTo(arr[i+1]) > 0)
//return false;
//}
String[] arrSorted = arr;
Arrays.sort(arrSorted);
The code is meant to input 2 arrays (they must be sorted even if this is not verified ) and then merge them in such a way that a sorted merged array is created at the end.I need to avoid a simple concatenation and then sorting the resulting array operation.I m interested in what i m doing wrong .
The input i used was :
Enter list1: 5 1 5 16 61 111 Enter list2: 4 2 4 5 6 import java.util.*; public class C7_31 { public static void main(String[] args){ Scanner input = new Scanner(System.in);
How to go through each link item in both lists, and directly link them into the new list in order without using insert()
class Link { public long dData; // data item public Link next; // next link in list // ------------------------------------------------------------- public Link(long dd) // constructor { dData = dd; } // ------------------------------------------------------------- public void displayLink() // display this link { System.out.print(dData + " "); } } // end class Link
How do u copy all the elements in an array eg A into another array eg B? This is the question:
An array A contains integers that first increase in value and then decrease in value,
For example, 17 24 31 39 44 49 36 29 20 18 13
It is unknown at which point the numbers start to decrease. Write efficient code to code to copy the numbers in A to another array B so that B is sorted in ascending order. Your code must take advantage of the way the numbers are arranged in A.
This is my program:
This is the error message:
Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException at java.lang.System.arraycopy(Native Method) at Quest30.CopyAndSortArray.main(CopyAndSortArray.jav a:16)
I'm trying to come up with a method that would validate each turn a player makes. For a turn to be valid, it has to only contain numbers from 0 to 3(inclusive) and at least one digit must not be 0. Here is what I`ve come up with so far. For example, with "303" as the number and "101" as the turn, the turn would be valid and my method should return true, but it does not.
public static boolean turnIsValid (String number, String turn ){ boolean rep=false; int pos1=0; char min='0'; char max='3'; while(number.length()==turn.length()&&pos1<turn.length()){
I tried to make a program that takes a string str, and char a and checks how many times the char is used in the string.
Example: the string Welcome and the letter e, is 2 times. so the program should print 2.
It compiles but when I run it and enter the information, i cannot get the printing line out.
Heres my code:
import java.util.Scanner; class program { public static void main(String[] args) { Scanner user_input=new Scanner(System.in); String str; String b; System.out.print("Please enter a word");
I am making a function to search through the whole inventory to see if any of the Lamborghini object has a certain model name such as aventador, diablo, etc....
This is what I have but I figured there's a big mistake when I make it true / false; it's making it going through the list and what's return is the last one instead of saying there's such match in the whole list or not.
public boolean hasCarModel(String modelName){ boolean exist = false; for (Lamborghini lambo : inventory){ String carModelName = lambo.getModelName(); if(carModelName.equalsIgnoreCase(modelName)){
[Code] ....
I figured if I add break; under exist = true; it'll work because as soon as it found one match then it'll turn to true and break out the loop but I don't think this is the best way to do it right?
I'm supposed to use stacks (implemented with an array) to check to see if a string is a palindrome. I've finished all my classes and methods, but I'm getting an ArrayIndexOutOfBoundsException when I try to run my demo program.Here are my classes:
public interface Stack { // Creates an empty stack public void initializeStack() // Returns true if the stack is empty, returns false otherwise public boolean isEmpty(); // The stack can never be full, so always return false public boolean isFullStack();
I tried to make a program that takes a string str, and char a and checks how many times the char is used in the string. Example: the string Welcome and the letter e, is 2 times. so the program should print 2. It compiles but when I run it and enter the information, i cannot get the printing line out.
Heres my code:
import java.util.Scanner; class program { public static void main(String[] args) { Scanner user_input=new Scanner(System.in); String str; String b; System.out.print("Please enter a word"); str=user_input.next();
I have to check a String input from the user in the form of firstName lastName (i.e. John Smith). I have to check for an exception called NonAlphabeticCharacterException that gets thrown if there is anything but a number in that string. This is what I have right now but should I create an array of char for the alphabet and then check the whole string for non alphabetic characters?
for(int i=0; i<name.length(); i++) { if()){ throw new NonAlphabeticCharactersException("Non-alphabetic character found"); } }
What is exact difference between them? Another thing is when I check (a==b) it retuns me false, but when I check a.equals(b) it returns me with true. Why So?
I started using Java a couple of days ago, If you haven't guessed I want to see if the user is typing a full name or not, but I'm actually not too concerned with any more complexity than I mentioned in the title. It's ok if an input like "GLba b" comes out positive.
Public static boolean updateNetMap(String filepath, String nodename){
// check the file pointed by filepath to have entry for nodename. // if it is there, get the start line no and end line no // Based on the line nos, need logic to remove the contents from the file. }
Below is the sample node entry, which we need to identify and delete (here nodename is WAS_CD1):
This SHOULD be a simple program, the gist of it is Given an element E and the array A that represents a set X (user input), write a program that determines whetherE is an element of X.I have the array list all set up to take the user input and make zero the last element of the array. I want user to input numbers into array, then have fixed numbers for E and check to see if E is in the Array. I guess I'm not sure how to check the array and see if E is in the array? Here is what I have so far...
import java.util.ArrayList; import java.util.Scanner; import java.util.List; import java.util.InputMismatchException; public class Set { public static void main(String[] args) { List<Integer> userInputArray = new ArrayList<Integer>();
Basically the requirements are to take a sentence (string of text) and check to see how many times specific words come up and then add to the counter depending on the word.
But I can not seem to get it to add the instances of the goodwords and badwords.
package Strings; import java.io.*; public class SentimentAnalyser { private static String analyse(String text) { int pw = 0; int nw = 0; String[] searchword = { "bad", "terrible", "good", "awesome" };
/** * Auto Generated Java Class. */ import java.util.*; public class Hangman { public static void main(String[] args) { Scanner input = new Scanner (System.in); int guess; boolean revealed[] = {false, false, false, false, false}; String word [] = {"c", "a", "n", "a", "d", "a"};
[Code] ....
I am not sure how to make the program check if the letter entered by the user matches the one in the array. also i am not sure how to make the program run again with a new word.
Nested for-loops always throw me in a loop.I found a snippet that uses 2 for-loops to check if there is a duplicate element in the array:
/* * brute force way of checking if array contains duplicates in Java comparing each elements to all other elements of array complexity on order of O(n^2) not advised in production */ public static boolean bruteforce(String[] input) { for (int i = 0; i < input.length; i++) { for (int j = 0; j < input.length; j++) { if (input[i].equals(input[j]) && i != j) { return true; } } } return false; }
Let us say we have: String[] input = new String[] {"one","two","three","one"}
I am trying to make a code that takes a list and puts the list in sorted order (least to greatest).
public class SortedIntList { static final int capacity = 10; private int [] data; private boolean unique; private int size; public SortedIntList(){ size =0; data = new int [10];
[Code] ....
Here what the code produces.
Testing SortedIntList() error when adding these values to list: 4 6 4 list should = [4, 4, 6] actual list = [4, 6, 4] was working properly prior to adding last value of 4
The final map would have all the values from Map A as a key and the values from Map B as values in the Final Map. Is there a way to do this using Java?
Write a program that promts a professor to input grades for five different courses for 10 students. Prompt the professor to enter only A,B,C,D, or F for grades(A is the highest grade, F fail). use variables for student number(1 through 10) and grade numbers(1 through 5). create a menu for Search. if the user select search it will prompt a letter correspond to grade. display all student with selected grade. if the user just enter nothing, display all student with their grade sorted from highest to lowest.
