This is a lab for one of my CS classes, and the assignment is to create a randomly filled array (values 10-100) and use these values as the height of an array of rectangles (essentially a bar graph)that will be drawn on a page. After that's done, the code should use the selection sort method to sort the bars least to greatest, being repainted as it's sorted.
I'm receiving no errors, the original draws just fine, and the code sorts the first position and then...it just hangs. Like it's in an infinite loop but I have all of the modifiers in place (I think. I've been staring at this code for three days straight and I don't think I really see it anymore). I've tried talking to my professor and I get that her private life is really busy right now, but she just keeps blowing me off and I don't know what to do. Anyway, done with back story and whining so here's the code.
Rectangle class:
import java.awt.*;
import javax.swing.*;
import java.awt.event.*;
public class Rectangle
I have a question about selection sort. If I had an array of numbers, 1 2 3 4 100 0, and used the selection sort method (below) on the array,would the 0 slowly work it's way down to the end?
I know it is possible to do this using the Array class but I don't want to use that. I am trying to use selection or bubble sort but I believe selection is what I want. This program asks the user to input 2 arrays with 10 integers each, sorts them from smallest to largest, then states whether they are the same or not. Comparing the two arrays.
import java.util.Scanner; public class SetDifference { public static void main (String args[]) { Scanner sc = new Scanner (System.in); int array1[] = new int[10]; int array2[] = new int[10];
This time I am having difficulties with selection sort method, but not with the method itself (I think). So I need to sort an array and return the result of each step.
This is the main code:
public class Functionality { public static int[][] selctionsort(int[] a) { for (int i=0; i<a.length; i++) { int least = i; for (int j=i+1; j<a.length; j++)
[Code] ....
And this is the Test folder:
import static org.junit.Assert.assertArrayEquals; public class PublicTests { public static void main(String[] args) { int[] a = new int[] { 35, 7, 63, 42, 24, 21 }; int[][] b = new int[][] { new int[] { 7, 35, 63, 42, 24, 21 },
[Code] ....
Now I am not sure what should I write in return since the 2nd (test) project has int[][] and in my main project I am working with int [].
However, whenever I run the method, the element that should go last, Zachary, in this case, ends up getting moved to the front for some reason. I'm not sure why.
I tried changing what the first element was initialized to, to the variable i as that would logically work as well, but it ends up missing the first element in the list.
Java Code:
public static void selectionStringAscendingSort (String[] words){ int i, j, first; String temp; for ( i = 1; i < words.length; i++ ) { first = 0; //initialize to subscript of first element for(j = i; j < words.length; j ++){ //locate smallest element between positions 1 and i. if( words[ j ].compareTo(words[ first ]) <0 ) first = j; } temp = words[ first ]; //swap smallest found with element in position i. words[ first ] = words[ i ]; words[ i ] = temp; System.out.println(Arrays.toString(words)); } System.out.println(Arrays.toString(words)); } mh_sh_highlight_all('java');
I am trying to write a program that graphically displays a selection sort. It needs to sort bars of various heights, and the bars heights are generated from an array of random integers. The program needs to show the bars swapping as they are being sorted, I am having trouble getting the bars to draw, it needs to look like a bar graph. Here is my code thus far (not counting my boiler plate):
import java.util.*; import java.awt.event.*; import javax.swing.*; import javax.swing.Timer; import java.awt.*; import java.util.Random; public class SelectionSortPanel extends JPanel
[Code] ....
Also right now it is giving an error from the compareTo method?
Mike Smith with a customer id of 100 has an account number of 1000 and a balance of $5,000.00 Hank Jones with a customer id of 101 has an account number of 1001 and a balance of $45,000.00 Sam Overstreet with a customer id of 102 has an account number of 1002 and a balance of $45,000.00 Hank Jones with a customer id of 101 has an account number of 1003 and a balance of $48,000.00 and so on .....
I am trying to do a selection sort by the account holders last name. I understand how to do if the Arraylist holds integers, but my arraylist holds multiple fields. I am not allowed to use collections as this is a homework assignment.
here is the Account Class
public class Account implements Comparable<Account> { private int acctNum; private double balance; private Customer cust; // note we are putting a Customer object in the Account clas private static int nextAcct = 1000;// used to keep track of the next available account number
/** * Use selection sort to sort the tracks by name. Return a new, sorted ArrayList of tracks. * * @return an ArrayList containing the tracks sorted by name, or null if no tracks exist */ public ArrayList<Track> getTracksSortedByName() { // YOUR CODE HERE if(tracks == null) return tracks;
[Code] ....
Here are my 2 issues (there are 2 lines with compiler errors): I feel like I understand selection sort and binary search, but am not sure how to apply it to the more abstract idea of a Track ArrayList (hence the 2 compiler errors). What should I use to make it work. Lastly, I'm very uncomfortable with recursion, so my guess is there is also probably some logical issue with it in the getTracksSortedByName method.
import java.util.ArrayList; import java.util.Random; public class NumSorting { public static int numOfComps = 0, numOfSwaps = 0; public static void main(String[] args)
[Code] ....
What is wrong with my code in this sorting program? It won't copy the random generated numbers to the sort method. How to get the random generated numbers to copy to the sort method. Below is what the program is displaying.
im trying to make a small program where the user enters their selection choice and it prints out the corresponding information. for example, if they choose "3", i want "3. Soup de Jour" to print out
import java.util.Scanner; public class rest { public static void main(String[] args)
how can I got about sorting an array that contains more than one value in a single element. Such as my array below has 4 values under one element. I know how to sort elements with single values however, slightly confused on this.
import java.util.Scanner; import java.util.Arrays; class Mobile {
I wrote this piece of code, and it is supposed to use bubblesort to sort the array. Yet somehow it re-aranges it, but doesn't exactly sort it. For example, when I enter [3, 5, 6, 9, 8, 4, 7, 5, 6, 2], it prints Done [2, 5, 9, 5, 7, 8, 4, 6, 3, 6]
Java Code:
import java.lang.*; import java.util.*; import java.util.Arrays; public class bubble { public static int[] array(){ int [] anArray = new int [10];
Directions: public static void initialize(ArrayList names, ArrayList sores)
You should write a function that sorts both array lists, based on the values in the scores array list. This is one of the more conceptually challenging parts of the assignment. You want to sort the scores array list, and simultaneously alter the names array list so that the names continue to line up with their respective scores by index. In the example data above, when the score 9900 moves to the first element of the scores array list, the name "Kim" should also be moved to the top of the names array list. The function should have the following signature:
I'm having trouble figuring out how to sort the lists.
import java.util.ArrayList; import java.util.Scanner; public class Assignment5 { /** */ public static void main(String[]args) { intializeArrays();
How I would sort two heaps into one array. I know that in a heap the "parent" is guaranteed to be larger than the "children".
So could I simultaneously traverse both trees in order, and while doing so, store the values of each node, one after another? This way the array would be partially sorted and then I could just use an insertion sort.
Is this logic reasonable or am I looking at it the wrong way?
For the assignment, we are supposed to make a checkerboard with alternating colors, then put images on top of certain spaces to act like "pieces." I did the checkerboard, but whenever I go to try and put an image the checkerboard, it doesn't appear! I put the image in the same directory as my other code as well. I did some experimenting and discovered that the image is appearing, but behind the checkerboard.
Here is the code:
import java.awt.*; import javax.swing.*; public class CheckerBoard extends JApplet{ public void paint(Graphics g){ super.paint(g); Image img1= getImage(getCodeBase(),"arrow1_nw.png"); g.drawImage(img1,500,500,this);
I have created a small program with methods of the Graphics class. I want to resize the frame and make it fit the screen, but after trying various layout managers, have come to the conclusion that by setting the sizes of the various shapes specifically in the paintComponent method, I can't resize. Is it possible to resize a frame with its paintComponent methods? Maybe I'm just not using the layout managers correctly but the Graphics just wont resize. I have tried setting the weights when I used GridBagLayout.. not working. I thought maybe there is a way to set the frame or panel to take the Graphics and then resize the panel. That doesn't work either.
I am writing a program which writes down all possible equation y=a+b+c values from min to max (in reality this equation would more difficult, but here is just short example).
The problem is that my sorting code can't get access to full array in loop.
Is there any way to pass array to sorting code, or somehow change sorting code?
package pkg06; public class Main { public static void main(String[] args) { double aS =-1; double aE = 3;
Merge sort implementation on the given array i listed in the code below. I know Arrays.sort() or Collections.sort() could do the trick but i want to achieve it through merge sort.
import java.util.*; public class Merge{ public static void main(String[] args){ String[] myStringArray=new String[]{"z","a","z","b","c","e","z","f" ,"g","a","w","d","m" ,"x","a","R" ,"q","r","y","w","j","a","v","z","b"}; } }
Code below. I am not sure if my logic is correct. I want to prompt a user to enter registration numbers from 100 to 1000, store the numbers in an array then sort them.
import java.util.Scanner; class regnumber { public static void main(String[] args) { Scanner in = new Scanner(System.in); System.out.println("registration number ", 100,1000);
I am having trouble with an array out of bounds exception. I understand what the error means (that I am trying to access part of array that does not exist). But I do not see the error in my code.
Java Code:
public class bubbleSort { public static void main(String []args) { int i; int array [] = {12,9,4,99,120,1,3,10};
I have read through some of the posts on insert sort /arrays and see close but not exactly what I'm looking for. I don't want to use a library to do work for me, I want to do it myself and understand it.
OrderedArrayList.java // import static org.junit.Assert.assertEquals; public class OrderedArrayList<T extends Comparable<T>> { // T is a variable that contains a class type, array of T things private T[] arrayA; // changed to private per example private T[] arrayB; int numElements = 0;// number of elements full (not null), used in multiple methods. numElement -1 = back
I am trying to draw a binary node tree to a text file.
public class BinaryTreeExample { public static void main(String[] args) { new BinaryTreeExample().run(); } static class Node { Node left; Node right; int value; public Node(int value) {
[Code] .....
This will output:
Building tree with rootvalue25 ================================= Inserted 11 to left of node 25 Inserted 15to right of node 11 Inserted 16to right of node 15 Inserted 23to right of node 16 Inserted 79to right of node 25 Traversing tree in order ================================= Traversed 11 Traversed 15 Traversed 16 Traversed 23 Traversed 25 Traversed 79
I need to print this information in the form of a graphic to a text file. so for example:
