im trying to make a linear search method to check if a number 'n' is included in an array.
PHP Code:
package test;
public class Recursion {
public static void main(String[] args) {
}
static int linearSearch(int n, int[] array)
[code]....
Im getting the following error: this method must have a result type of type int ?? i already have a return type of type int...
I am attempting to find the element that holds the lowest time ( i have used System.currentMillisTime ) in the array using a linear search and to then print the times held by the array in lowest to highest order . While i understand how to do a linear search using user input as the key i am not to sure how to do it by initializing a search key in the program to the lowest number and have little experience in using a search in a program that is not a simply linear search. i have attempted to code this, as seen below, but i know i am definitely wrong and i have tried another of different ways even Array.sort and then a binary search .
static long store_MAX[]; // Now an ‘array’ of ints
static int deptSize; // Holds the length of the buffer
private int shopper_MAX; // Holds the number of items in the buffer
[Code].....
I am having some trouble with linear search of a customers last name. I can't seem to get it to work. I have looked up examples but cant find many with Array Lists. Here is my code.
import java.util.ArrayList;
import java.util.Scanner;
public class AccountDriver {
public static void main(String[] args) {
ArrayList<Account> al = new ArrayList<Account>();
ArrayList<Customer> cust = new ArrayList<Customer>();
Scanner scan = new Scanner(System.in);
[code]....
import java.util.*;
public class SumOfAllEvens {
public static void main (String[] args) {
Scanner s = new Scanner (System.in);
//for (int i=1; i<4; i++){
int usernumber;
[code]....
I'm supposed to use a for loop that runs until it reaches the number input by the user, but I'm not sure how to tell the program to add the user's number along with all of the even numbers in between the user input and 2.
We are required to write a binary‐search method to find an int within an array of ints. Without using any functions besides the basics (for loops, if statements, etc.)
I have this so far:
public int binarySearch(int[] ints, int n) {
for(int i = 0; i < ints.length; i++) {
if(ints[i] == n) {
return ints[i];
}
}
}
Does this look somewhat correct?
I'm trying to build a method that can search a binary search tree for a specific target and then return the number of probes it took to get there. It seems to me that the best way to do this would be a recursive search method and a counter that tracks the number of calls. But I'm struggling with how to implement this. Here's the code I have so far. what works/doesn't work with the method.
// Method to search the tree for a specific name and
// return the number of probes
public T search(BTNode<T> btNode) {
[Code]....
I'm studying about arrays and I have some questions:
First, is there any difference between these two?
Java Code:
int x[] = new int[3];
int[] x = new int[3]; mh_sh_highlight_all('java');
It seems to me when I try them they do exactly the same, is that correct?
Second, more important question. If I want to make an int variable that refers to the index number of an array, how do I write? For example if we have
Java Code: String[] string = new String[10]; mh_sh_highlight_all('java');
And I want to have a variable "int n" that refers to an index number, so that if I set n = 5 then string[5] is selected. Note that the int n is NOT an array, but just a regular integer variable. How can I do that?
I made a method which takes values from a data set and finds out which one is the highest value. When it finds the highest value, it returns the country which is associated with the value. Here's the data set.
"Country""Total CO2 2005 (million tonnes)""Road CO2 (million tonnes)""Road CO2 per person (tonnes)""Cars per 1000 people"
10
USA5951.131530.35.16777
UK2573.4119.681.99470
Italy476.08116.862592
Germany841.78150.211.82550
Canada553.02123.423.82562
France414.03128.132.04477
Russia1575.44114.690.8178
Japan1254.47224.241.76447
China5100.6228.020.317
India1147.4691.060.18
So if the number was 5951.13 then the program would return USA. How do I do that? I've already started on trying to get this code to work but it doesn't seem to compiler so what's wrong with it?
public static CO2Data highest (CO2Data [] arr2){
Scanner sc = new Scanner(System.in);
CO2Data highestindex = arr2[0];
CO2Data currentcountry = arr2[0].getCountry(sc.nextLine());
[Code] ....
Also the array is a CO2Data array which is part of the following class:
public class CO2Data { //The CO2Data class will be called in other methods
private String country; //A private variable will prevent other users from accessing and changing these variables.
private double totalCO2;
private double roadCO2;
private double CO2PerPerson;
private int carsPerPerson;
public CO2Data() {
country = "";//this sets the initial values for the different variables
[code].....
I want to create a search method that returns the frequency of a word in the search method.
public class IndexTree {
private class TreeNode {
TreeNode left;
String word;
int frequency;
TreeNode right;
[Code] .....
I'm working on a simple 2D Game Framework. Currently it's creating a window, but I'm working on an update method.
I constantly export the framework as a .jar file, and I've added it to the game's build path (using eclipse). I wonder if I can check all classes in the game-project (the project in which I've refecrenced the Framework in) for a specific method (for example update()) and call all found methods with that name from the framework's main class, like this:
public class FrameworkClass1 {
private void checkForUpdateMethods() {
// Check for update methods on program start
} public void update() {
runAllFoundUpdateMethods(); // Run all update methods found in the scan
}
}
I want to do this because it would be a simple way to update and render the game. If the main game-class look something like this:
public class Game {
public void update() {
// Update the game every time this is ran
}
}
it will be automatically updated, because it contains a method named update(), instead of naming the main game-class with a specific name etc. It will simply be more flexible that way!
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()){
[Code] ....
I need to check numbers from 1-39 and see if the number has been or has not been a winning number in the last week lottery. How to do that?
This is code for random number, 7 numbers
import java.util.ArrayList;
import java.util.Random;
public class Loto {
public static void main(String[] arg) {
ArrayList<Integer> al = new ArrayList<Integer>();
for(int i = 1; i <= 39; i++)
[Code] ....
Faster algorithm.... I want to know whether a number n1 is divided by n2 without remainder. I know I can simply write if (n1 % n2 == 0) ... But it's not fast enough.
Currently I use:
double div = (double) n1 / (double) n2;
If (div == (int) div){
...
}
This is faster than the mod operator. I just look forward to any micro optimizations or such.
Code for search number from tuple tree? I want to add into my code below. My idea below is to search number from the tree and then print the number. For example, enter input for event is 4, input for strength is 3. Then generate tuple tree. Then user enter number for searching. That number will check every branches in the tuple tree. Then it will printout the number.
Main class code.
package treejava.main;
import java.util.Scanner;
import treejava.utils.TreeUtils;
public class MainClass {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
System.out.println("----Welcome to the Tree Java-Based program-----");
[Code] ....
I have this program where I'm supposed to fill an array with 1000 indices with 1000 randomly generated numbers between 1 and 1000. The program is supposed to check if any of the numbers match an index that is the same value (so for example, the number 4 is in index 4). How to check for that condition, especially using a binary search (I'm also told to use a binary search).
Right now the variable index isn't initialized because I don't know what to initialize it to exactly. How do I check to see if any numbers match the value of the same index?
import java.util.*;
public class Identity {
public static void main(String[] args) {
int [] integers = new int [1000];
// Fill array with randomly generated numbers
int [] display = GenerateRandom(integers);
[Code] ....
Write a program that prompts the user for an input number and checks to see if that input number is greater than zero. If the input number is greater than 0, the program does a multiplication of all the numbers up to the input number starting with the input number. For example if the user inputs the number 9, then the program displays the following sum:
9 * 8 * 7 * 6 * 5 * 4 * 3 * 2 * 1 = 362880
That's the question I'm getting and so far all I've got is
import java.util.Scanner;
public class Lab4Q3
{
public static void main (String[] args)
{
int keyboard;
[Code] .....
In a text file, I have individual titles (starting with ">" character), and under those titles, I have calculated values for a Counter. I want to search the entire text file for the highest counter under every title. After I get the highest counter, I would like to print it's title, name of the counter, and counter value. Example of the code I already have:
int letterCounter;
String line;
if (line.startsWith (">")) {
bw.write ("");
bw.write (line);
} else {
//code that counts how many total letters (letterCounter) under title
}
I am just trying to use basic concepts.
Sample of my text file:
>gi 91206428 ref NP_001035160.1 seven transmembrane helix receptor precursor [Homo sapiens]
letterCounter is 43
>gi 157412240 ref NP_001094800.1 C1GALT1-specific chaperone 1-like [Homo sapiens]
letterCounter is 7
>gi 117938299 ref NP_001071105.1 RAB6C-like [Homo sapiens]
letterCounter is 109
Sample of desired output:
>gi 117938299 ref NP_001071105.1 RAB6C-like [Homo sapiens]
letterCounter is 109
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>();
[code]...
I have a requirement like to attach most suitable flow to a request
Flows should be like below (eg:Flow1) .We can create n number of flows with any combination of values.
When I tried to create a request that have all the features in the flow. And I have to attach the most suited flow to that request.
Suppose my request have the feature Place = Place1 and company =Comp1 and Job=Job1 .here most suitable flow is Flow1.
So my question is how can I implement the logic in java for getting the most suitable match.
I would like to avoid "Not on FX application thread" exceptions beforehand. Is there a reliable way to determine if Toolkit.checkFxUserThread is called by a specific method call? Such a check could then be included in the build process.
View Replies View RelatedI am currently taking a class thats requires me to use flowcharts in a way t figure out algithrims This is the flowchart that i need to use: [URL] .....
This is my current code.
public int binSearch(int target) {
int first = 0;
int last = count -1;
int found =0;
int middle=0;
while (first <=last && found == 0)
[Code] ......
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);
[code]....
B is an array Object, as you can see if an element is null or not?
View Replies View RelatedI am trying to create a method that prints the square root of a number up to a certain number. It needs to take a single int parameter for example "n" , and then print all of the (positive) even perfect squares less than n, each on a separate line. I want the method to be called something like this:
public void Squares(int n) {
}
I need the output to look something like this:
Example: if n = 40, your code should print
4
16
36
So I have been working for a few hours now and am really stuck.
This is what I have so far:
int count = 0;
int n = 4;
int max = n;
while(count < max) {
System.out.println(n);
n = n * n;
count++;
<input type="text" name="test" class="form-control input-sm" maxlength="20"/>
This is my textbox can i include in my tetxbox that it will no accept special characters?
Can i configure it there? like maxlength="20" w/c is character limit is set to 20, not allowing special characters be configure like that , character="speical is not allowed" something like that?
Suppose you have an abstract class say Sparrow that extends the abstract Bird class. The abstract Bird class has the abstract methods, fly() and run()
How many methods from the Bird class should you implement in the Sparrow class?