I have been working on getting the merge sort working, I have a complteted code but am not getting the right results... Here is my code and the results are "876323149" ...
public class MergeSort
{
private static int[] local; // for use in copying
private static int[] a;
public static void main(String[] args) {
int[] test = {2,3,1,4,7,8,6,3,9};
[Code] ....
I've playing around with linked lists and methods for sorting. So far I've tested the iterative sort, insertion sort, quick sort and they all worked perfectly. Now, I am trying to implement merge sort that would take a linked list of jobs and sort them according to their priority. I found a few solutions on the web, of which I am trying to implemented this one: LeetCode.
My system is a simple one, I do have a linked list of print jobs, each of which has the priority. The following code should sort my print queue and return the link node of the first sorted element. Here's the code.
//defining a job that has priority
public class Job {
private int priority;
[Code]....
The problem I've been trying to solve is that I am getting the stack overflow at line
ListNode<T> h1 = mergeSort(left);
meaning that I am getting into a loop somewhere down through the process of breaking the linked list into half, half or halfs and so on.
How do i make this merge sort take on random numbers in an array instead of hard coding the numbers
Integer [] a = {8, 2, 6, 7, 5, 4, 3, 1};
mergeSort(a);
System.out.println(Arrays.toString(a));
}
public static void mergeSort (Comparable [] a){
[code]....
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"};
}
}
I am new in java.. I am having a problem when doing merge sort. This is my coding...
Java Code:
import java.util.*;
public class Person
{
public static void main(String[] args)
{
String[] list = {"
[Code] ....
the error is incompatible type at 'sorted = merge(left,right);'
I'm having a problem printing out the descending order of my array. The array order goes like (Title,Studio,Year). I try to create to ints with the compareTo method but when the program is run the I get array out of bounds. Could the answer possibly be that in order not not have the out of bounds error, to create a for loop inside of the while?
public class Movie2
{
// instance variables
private int year;
private String Title;
private String Studio;
[code]...
Suppose i have written a method like this
public void myWork(){
mergeSortMyData(); O(nlgn)
....
someProcessing(); O(n^2)
someprocessing2(); O(n^2)
}
then what will be time complexity of my code...according to me it will be O(nlgn + n^2) ...is it correct ?
I have this assignment to write a Merge Sort algorithm using recursion. To start I have a very tough time picturing what is happening when it comes to recursion, but I do understand how merge sorting works. At the moment I feel as though a very good portion of my code is correct, but I am having trouble with the recursion in the main method [ mergeSort(Queue<T> queue) ].
I have another 4 or so hours to pass in my assignment finished or not, and at this point I can honestly say I have no clue how to make my code work. I tried working through the problem on paper with a simple queue of size 3, but even that is a struggle. On paper my code works perfectly fine, so there is definitely something I am missing.
Below is what I have along with my JUnit test.
Java Code:
private Queue<T> output = new Queue<T>();
private Queue<T> output1 = new Queue<T>();
private Queue<T> output2 = new Queue<T>();
public Queue<T> mergeSort(Queue<T> queue) {
// TODO 1
if(queue.size() <= 1) {
return queue;
[Code] .....
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
{
[Code]......
when I am programming let say in VB using Visual Studio, finally I build .exe file that can be run on all Windows by double click.For Java I am using Eclipse and to run those apps I am using run from Eclipse.How I can create a sort of "executable" for my Java app that I would be able to run it by file click on Windows or Linux?
View Replies View RelatedI got this code from wikipedia when trying to learn about the radix sort algorithm now I understand that the algorithm sorts by significant digits but it's the code that I'm not too sure about for instance the series of for loops at the bottom what exactly is going on there and why is it mod by 10? Also why are there three different integer arrays a, b, and bucket?
public static void radixsort( int[] a, int n) {
int i;
int digit = 1;
int[] b = new int[n+1];
for (i = 1; i < n; i++)
if (a[i] > a[0])
a[0] = a[i];
[Code] ....
I am trying to code a program that orders 5 random numbers from high to low with the basic coding i know (im starting to learn theory of methods... so you can imagine) When i run the code i cant get all 5 numbers ordered but my logic says the code is right although it's pretty confusing.
I know you could code in a simpler way but first i wanna get it as it is right now. When i debug (on my own way cause i dont know how to actually use it) shows line 72 with yellow color.
public class NuevaCalculadora {
import java.util.Scanner;
public static void main(String[] args) {
[Code]....
I have been looking around and I cannot seem to find which algorithm java uses for its sort method. Merge, sort etc.
While I am on the topic BinaryTree is a balanced heap right?
Are there any libraries for depth or breath first search?
Is the ArrayList a double linked list?
I have to count the comparisons in the quick sort. I have done it by using a global variable. But I am stuck in doing it recursively.
This is my code.
import static java.time.Clock.system;
import java.util.Arrays;
public class test {
/**
* The swap method swaps the contents of two elements in an int array.
*
* @param The array containing the two elements.
* @param a The subscript of the first element.
* @param b The subscript of the second element.
*
*/
[Code] .....
I have to write the Insertion Sort Algorithm using Java codes and at the same time find the time of execution for different sizes of array, filled with random numbers. If I try to show the numbers inserted into the array randomly, they don't appear at the console.
import javax.swing.JOptionPane;
public class Insertion {
public static void main(String[]args){
int SizeArr = new Integer(JOptionPane.showInputDialog("Enter the size of teh array")).intValue();
int [] r= new int [SizeArr];
{for(int d=0; d<r.length; d++)
[Code]...
Have 2 files File1.csv and file2.csv containing some values. Have to read both files and write unique values in to another file.
In the new the there must be unique rows and not duplicate rows (2 files contain some rows same). What is the best approach for doing this?
So I have two related tables - Country (Master) Projects (Detail). Country has a OneToMany relationship with Projects. I put a link on my AllProjects.xhtml page. When tyhe link is clicked it uses a data model class to to display the current (clicked) project record (projectRecord object). After editing all the details, the UPDATE button calls a merge method in the DAO class. On the first attempt to update, nothing happens and the record is returned as it is with no errors. If I try updating again, I get:
Error Code: 1062
Call: INSERT INTO projects_beta2b_projects_beta2b (projects_PROJECTID) VALUES (?)
bind => [1 parameter bound]
Query: DataModifyQuery(name="projects" sql="INSERT INTO projects_beta2b_projects_beta2b (projects_PROJECTID) VALUES (?)")
[Code] .....
My classes are:
projects.java
@Entity
@Table(name = "projects_beta2b")
public class Projects implements Serializable {
@Id
@GeneratedValue(strategy = GenerationType.AUTO)
private int projectid;
private String projectName;
private String client;
[Code] ...
Is the 'new' keyword in the entity class causing the Inser statement in the DAO because the JPA thinks I want to create a new object therefore invokes INSERT instead of UPDATE?
I searched a lot and got some answers for this Q. but many of them referred to links which give 404 error. I want to make table like this:
Can I make this in Java?
I have a database table containing two columns A and B. They both contain integers. I'd like to know if it's possible, when displaying them in a JTable, to be combined in one column X. I still need, however, to be able to distinguish them from each other when selecting a row from the JTable. E.g. to store each of the values in a a separate variable. Maybe I can combine them when reading from the ResultSet and use some sort of delimiter ? But how?
View Replies View RelatedI have a small problem to solve by which I would like to merge 2 sorted maps into 1.
Map A
-------
Keys, Values
1, A
2, B
3, C
4, D
5, E
Map B
-------
Keys, Values
1, 10
2, 20
3, 30
4, 40
5, 50
Final Map should look like:
Keys, Values
A, 10
B, 20
C, 30
D, 40
E, 50
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?
I've 2 tables in my MySql DB,Employees and Assets & I want to pick 2 columns Employees and one column from Assets,then how would I display them into a JTable??
View Replies View RelatedI have a file called config.dedserver and on a JButton click I am editing the values in it using setProperty but it didn't work. It removed everything from the entire file and then added the properties.
This is my code:
String newGems = gem.getText();
String newGold = gold.getText();
String newElixir = elixir.getText();
String newDE = de.getText();
try {
Properties props = new Properties();
props.setProperty("startingGems", newGems);
[Code] ....
And this is what the original file is:
Quote
# Main configuration file for DEDServer
# Starting resource values
startingGold=1000000
startingElixir=1000000
startingDarkElixir=1000000
startingGems=1077
# Saving method. Valid values are:
# -none: database disabled
# -h2: use h2 database (default)
saveMethod=h2
# Save interval (milliseconds)
saveInterval=60000
I need to read the contents of file A, and B and store it in file C by joining the contents of A and B and also counting the number of letters/characters present in it.
I've come up with this so far.
import java.io.FileInputstream;
import java.io.FileNotFoundException;
import java.io.IOException;
public class JavaApplication43{
public static putwrite(string fname) throws FileNotFoundException, IOException
[code]...
I am trying to understand the package and import functions.
The path to access the file " library.book" is
C:UsersKameshDesktopJava SessionJAVAOCA7ooklibrary
and i can see 3 txt files
Book.class
Book.ctxt
Book.java
while compiling i am getting <identifier>expected error.
Here is the code :
package library;
public class Book {
public String isbn;
public void printBook() {}
}
package building;
[Code] .....
The error i get is <identifier>expected.
how to create pdf file while working in java.
View Replies View RelatedI had a game written in a 500x400 window using JFrame and a threaded JPanel. It used KeyListener to detect user input and worked just fine, problem was it was very click dependent and therefore I wanted to put it into fullscreen mode so I would no longer come across the problem of clicking outside the window and being taken out of the game. But when I ported the game to Full Screen Exclusive Mode the KeyListener no longer seems to be working and I have no clue why. I tried using KeyBindings as well, that code didn't work and is left commented out in the FSEM code.Here is my code for the windowed application:
import java.awt.Container;
import javax.swing.*;
public class Main extends JFrame{
private GamePanel panel;
public Main(){
panel = new GamePanel();
[code]....