Algorithm help

i have an issue trying to figure out the proper way to insert records into a database table. i apologize if this is more a database question than a java question but i didn't know where else to turn.
my issue is trying to understand the best way to deal with autoincremented primary key fields used as row ids when you would need to use them for other detail and line tables. lets say it is a user table and i insert a user into it and its id is created off the autoincrementor...i proceed to want to add records to other tables and link them to this user i need to know what the id incremented to?
so is the following algie correct:
synchronize {
insert record;
get max(id) from table;
thx, graeme.

hmm, yes good point. i just read up on the mysql
docs some functions that are connection specific so
that can be sure the value retrieved won't be
affected by other connections:If you set the isolation level properly and do things in a transaction you'll be fine.
>
i.e. last_insert_id(). thanks for the reply i'm
going to look into these sequencers of oracle as well.Bad idea. This is MySQL-specific. The instance you use this function, your code isn't portable anymore. At least hide that implementation behind an interface if you must.
It's SEQUENCE, not sequencers.
%

Similar Messages

Need algorithm help

I need some help with my 3 class hangman program.
whenever the program is run, it doesn't function as intended when a letter is entered. Any advice is greatly appreciated.
Here's what I have so far:
import java.awt.*;
import java.awt.event.*;
import javax.swing.*;
//<applet code="Hangman.class" width=400 height=400>
//</applet>
public class Hangman extends JApplet implements ActionListener
     private final int WIDTH = 400;
     private final int HEIGHT = 400;
     private JPanel panel,tools;
     private JLabel inputLabel;
     private Hang drawing;
     private JTextField guess;
     RandomWord t = new RandomWord();
     public String answer = t.getWord();
     public void init()
          tools = new JPanel();
          tools.setLayout(new BoxLayout(tools,BoxLayout.X_AXIS));
          tools.setBackground(Color.yellow);
          tools.setOpaque(true);
          guess = new JTextField(1);
          guess.addActionListener(this);
          inputLabel = new JLabel("Enter Guess:");
          tools.add(inputLabel);
          tools.add(guess);
          drawing = new Hang();
          panel = new JPanel();
          panel.add(tools);
          panel.add(drawing);
          getContentPane().add(panel);
          setSize(WIDTH,HEIGHT);
     public void actionPerformed(ActionEvent event)
          String g = guess.getText();
          int incorr = 0;
          int c = 0;
          int i;
          for(i = 0;i<answer.length();i++)
               if((answer.substring(i,i+1)).equals(g))
                    c++;
                    drawing.setLetter(i,g);
          if(c == 0)
               incorr++;
               drawing.setIndex(incorr);
          repaint();
// class number 2:
import java.awt.*;
import javax.swing.JPanel;
public class Hang extends JPanel
     private final int PAN_HEI = 400;
     private final int PAN_WID = 400;
     private int index;
     private int posNum,corr = 0;
     private String print;
     public Hang()
          setBackground(Color.black);
          setPreferredSize(new Dimension(PAN_WID,PAN_HEI));
     public void setIndex(int v)
          index = v;
     public void setLetter(int y,String s)
          print = s;
          posNum = y + 1;
     public void drawBase(Graphics page)
          setBackground(Color.white);
          page.setColor(Color.black);
          page.fillRect(0,350,150,50);// base
          page.fillRect(0,150,25,200);
          page.fillRect(0,125,100,25);
          page.setColor(Color.gray);
          page.fillRect(84,125,7,50);// rope
          page.setColor(Color.black);
          page.drawOval(75,175,24,25);// head
          page.drawLine(250,55,255,55);
          page.drawLine(260,55,265,55);
          page.drawLine(270,55,275,55);
          page.drawLine(280,55,285,55);
          page.drawLine(290,55,295,55);
          page.drawLine(300,55,305,55);
          page.drawLine(310,55,315,55);
     public void paintComponent(Graphics page)
          super.paintComponent(page);
          this.drawBase(page);
          if(index == 1)
               page.drawLine(84,200,84,250);
          if(index == 2)
               page.drawLine(84,215,34,175);
          if(index == 3)
               page.drawLine(84,215,116,175);
          if(index == 4)
               page.drawLine(84,250,50,300);
          if(index == 5)
               page.drawLine(84,250,100,300);
               page.drawString("You Lose",250,75);
          if(posNum == 1)
               corr++;
               page.drawString(print,250,50);
          if(posNum == 2)
               corr++;
               page.drawString(print,260,50);
          if(posNum == 3)
               corr++;
               page.drawString(print,270,50);
          if(posNum == 4)
               corr++;
               page.drawString(print,280,50);
          if(posNum == 5)
               corr++;
               page.drawString(print,290,50);
          if(posNum == 6)
               corr++;
               page.drawString(print,300,50);
          if(posNum == 7)
               corr++;
               page.drawString(print,310,50);
          if(corr == 7)
               page.drawString("You Win",250,75);
//last class :
import java.util.Random;
public class RandomWord
     Random g = new Random();
     String w1;
     String w2;
     String w3;
     String w4;
     String w5;
     String w6;
     String w7;
     String w8;
     public RandomWord()
          w1 = "freedom";
          w2 = "justice";
          w3 = "impulse";
          w4 = "destiny";
          w5 = "celsius";
          w6 = "ignited";
          w7 = "believe";
          w8 = "realize";
     public String getWord()
          String x = " ";
          int a = g.nextInt(6);
          if(a == 0) x = w1;
          if(a == 1) x = w2;
          if(a == 2) x = w3;
          if(a == 3) x = w4;
          if(a == 4) x = w5;
          if(a == 5) x = w6;
          if(a == 6) x = w7;
          if(a == 7) x = w8;
          return x;
}I'm a very inexperiencd programmer as you can see.

Darn, I thought you actually needed algorithm help. But instead all I see is:
"Here's all my code. It doesn't work right. Let me plop it onto your virtual desk and ask that you just fix it for me. I'm going shopping (or whatever) and will be back soon."

Color Picker scripting or Levels algorithm help

First question is: Does anyone know of a good explanation of the Levels algorithm as in how each setting affects a pixel in an image. If I change the midpoint of the levels, how would a specific pixel change in relation to that? I've been experimenting for hours and can't figure a common factor other than it seems to be a binary type relationship. The reason I ask this is because I'm trying to script something that will balance colors.
If that method isn't practical, I can go to the old fashioned trial and error method but this way also presents a roadblock to me. I set a color picker point and the script can obtain the values from that point exactly as it is in the Info panel. If I put a levels adjustment layer over top and adjust it, I now see the original color value and the adjusted color value in the Info panel, but I can't figure out how to obtain the adjusted value with a script. It still returns the original value. Does anyone know a way to obtain the adjusted value?
I hope I explained this right.

Thanks, Michael.
I'll have to look through that post on ps-scripts.com in more detail. That might be what I need.
This little snippet you wrote:
Michael L Hale wrote:
This thread may help with the levels part. http://ps-scripts.com/bb/viewtopic.php?t=2498
As for the adjustment layer you need to get the color twice. Once with the adjustment layer visible then again with it not visible.
var csColor = activeDocument.colorSamplers[0].color;
activeDocument.layers.getByName('Levels').visible = false;
var csColor2 = activeDocument.colorSamplers[0].color;
alert( csColor2.rgb.red + " : " + csColor.rgb.red );
doesn't get me the before and after values. Example: The point I selected has a red value of 226. I added a Levels adj layer on top and moved the midpoint so the red value at that point (adjusted) was 234. I ran your code and it came back with 225.591439688716 : 225.591439688716. It isn't showing the adjusted value of that point.

BGP decision algorithm - help needed - stumped

Hello gurus! hoping for a BGP expert to chime in here. Im studying for my CCIE, and there is something in Jeff Doyle's Routing TCP/IP vol2 book that I just cant seem to figure out and its really stalling my understanding of the BGP path selection algorithm.
Its on pg 195, example 3-57, attached as an image in this post (Ive also attached the network diagram that this output refers to). Basically its an output of "show ip bgp" and whats stumping me is simply: for the aggregate route 192.168.192.0/21, why has this router selected as best (>) the one via next hop 192.168.1.254?? I would have thought based on the presence of the LocalPref = 100 on the 192.168.1.237 route that would have been selected. But apparently not! Heres a walk through of the path selection logic as i understand it:
1/WEIGHT: both 0, so skipped.
2/LOCAL_PREF: this is my problem, .237 should win, but ignoring for now...
3/ORIGINATED LOCALLY: neither are they are learnt from BGP peers, so skipping.
4/AS_PATH: both identical, AS100 only, so skipping
5/ORIGIN CODE: both are 'i' (IGP), both were created from "aggregate-address" statements on their originating routers downstream in AS100
6/MED: both empty, so skipping
7/PREFER [eBGP] over [confedBGP] over iBGP: so the .254 route apparently wins on this condition... which in isolation, i agree with (clearly the eBGP .254 route is better than the .237 iBGP candidate).
.... however what about step 2/LOCAL_PREF!?
looking forward to some expert guidance here to help me squash this one :)
thank in advance,
Keiran

Hello,
Keiran are you talking about "Orgin" attribute or ORIGINATED LOCALLY as this attribute i am not able to find it...that attribute anywhere:
http://netcerts.net/bgp-path-attributes-and-the-decision-process/
Path Attributes:
Attribute
Class
ORIGIN
Well-know mandatory
AS_PATH
Well-know mandatory
NEXT_HOP
Well-know mandatory
LOCAL_PREF
Well-know discretionary
ATOMIC_AGGREGATE
Well-know discretionary
AGGREGATOR
Optional transitive
COMMUNITY
Optional transitive
MULTI_EXIT_DISC (MED)
Optional nontransitive
ORGINATOR_ID
Optional nontransitive
ORGINATOR_ID
Optional nontransitive
CLUSTER_LIST
Optional nontransitive
Also there is similar question on learning forums:
https://learningnetwork.cisco.com/thread/36845
From the forum:
"Locally Originated means that the local router is the one that generated the route with either a network statement, and aggregate statement, redistribution, or conditional route injection. It's not an attribute that is included in the UPDATE messge, instead it's just used by the local process as part of the path selection, where the router will prefer its own locally originated routes over someone else's origination of the same prefix."
Hopefully this will help.
BTW i am reading same book and too bad Mr. Doyle did not include full configs for all routers, as i am trying to simulate his scenarios sometimes it is not working as in his book, now i have issue on next page 197 why Orgin IGP is not taking precedence over Incomplete even if one is learned via EBGP and other over iBGP...driving me nuts.
Regards,
Lukasz

Combination Algorithm Help

I have a basic outline of an algorithm that produces combinations of 1-8 but I would like to produce the combination 8C3. What changes need to occur with this problem to get the answer that I'm looking for. Your help will be greatly appreciated. Thanks a lot.
import java.io.*;
import java.util.*;
import java.util.Vector;
public class Combs
     public static void main(String[] args)
          System.out.println(get("1 2 3 4 5 6 7 8"));
     public static String get(String s)
          StringTokenizer st = new StringTokenizer(s);
          Vector v = new Vector();
          while(st.hasMoreTokens())v.add(st.nextToken());
          String a = "";
          for(int i=v.size()-1; i>=0; i--)
               for(int j=0; j<v.size(); j++)
                    if(j != i)
                         a += (String)v.get(j);
               a += "\n";
          return a;
PS if anything is unclear please ask and I will try to clear up my questions. Thanks again

I have posted a related code in the following.
http://forum.java.sun.com/thread.jsp?forum=31&thread=382917&start=0&range=15#1647420

Algorithm Help: Adjustable scale marks

I'm writing an app which displays a scale which is movable and resizable. It might display a range from 0.127 to 0.516, or 10,657 to 100,453.
1 - I know from the size of the font and window, number number of marks which I want drawn across that range. A value nominally between 10 and 15.
2 - I want the marks to be on sensible boundaries, 0.1, 0.25, 0.5 etc.
An example is that for a range 0.089 to 1.272 I'd want ticks 0.1, 0.2 ... 1.1, 1.2
Can anyone offer me any help with an algorithm to work out the ticks.
Thanks.
Dave.

I have always had to brute force this kind of thing. But I would try the following. Subtract the smaller number from the larger number and divide by the number of ticks. (or the number of ticks + 1, whichever works!) This gives you units per tick. Adjust the lower tick to be the nearest sensible number below your minimum.
This is tricky and there will be lots of special cases. If your ranges are in any way consistent, it might be best to use a bunch of canned ranges.

I need an algorithm, HELP!

If I input something like this:
a->b,
a->c,
b->d,
d->a,
and so on, could be many,
the the output is this: a->b->d->a, which is a circle from the input.
I need such a algorithm to help me find out all the circles from the input.

Cross post of [http://forums.sun.com/thread.jspa?threadID=5447698&tstart=0|http://forums.sun.com/thread.jspa?threadID=5447698&tstart=0].
Please don't post the same question in multiple forums since people may waste their time answering in one forum when a perfectly good response has been posted in another forum. If you feel the need to get a wider exposure of your problem then create a thread that links to the master thread and request responses be made only in the master thread.
I shall lock this thread.

Genetic Algorithm help please!!!!

Hi people, i really need help badly with a project im doing as im not very good at programming yet,
The project is as follows
Project Allocation
This project will develop a Genetic Algorithm that will evolve project allocations, with the aim of maximising several criteria: giving every student the highest ranked project possible, spreading the project load between lecturers etc. It should work for a single group of students, and for several groups. This project could be coded in any suitable language.
Any help in coding this would be really welcomed!
Thanks

kennalan wrote:
your right warneja but what can i do, Start by learning English: that should be "you're", as in "you are".
What can you do? Do what all students are expected to do - work hard, struggle with difficult material until you achieve some measure of mastery, and accept the result.
i just need some source code Our source code? Something that you'll steal and pass off as your own? In my universe, that's called "cheating". What do you call it?
or anything to help!Here's some advice: Don't come back here unless you have problems with code that you've written, with specific questions about the problems.
Google for something and get started. I recommend "Java genetic algorithms" as a search criterion.
%

Logic Execution Algorithm - Help

Help for me - Logic Execution Algorithm
Considering the Execution Sequence 1: Consider the following information in the table GBI_PAR_DEFINE_ROTA parameterized.
The required fields are filled in by users: Required_Res_1 and one of the fields:
Product_id, customer_id or Sales_Order_No.
Off the field will only be filled with the value N if you want to disable the rule. If the value of the rule is N, the routine being developed disregard the rule.
REQUIRED_RES_1 PRODUCT_ID SALES_ORDER_NO CUSTOMER_ID OFF
P_P_LAM2 P_289874 18669437-20 WHGA
Step 1: Find Table MP_WO_REP which records have sales order number 18669437-20.
Step 2: Within these sales orders, search through the table Works_Operation which ones have the field Product_ID = P_289874.
Step 3: Restrict further data selection Sales_Order searching the table, which of them belong to the client WHGA.
Step 4: In the records remaining in the table Works_Operation verify which code Alternate_Pref whose field Required_Res_1 equals P_P_LAM2. If more than one return Alternate_Pref (different) for the same product_id Required_Res_1 and generate a table of error called GBI_ERR_ALTERNATE_PREF, containing the following information: Required_Res_1, Works_Order and product_id. If this error occurs, the following steps should not be performed.
Step 5: In the remaining records, delete those records whose field Alternate_Pref is different from the value returned in Step 4. IMPORTANT NOTE: The records can only be deleted if they exist for the same product_id Alternates_Prefs different. These same deleted records should be inserted in the table Works_Operation_Rota_Excluida.
Step 6: Deleted records Works_Operation table must also be deleted from the table Works_Op_Char. Fields of connection between these two tables are: Works_Order_No, Version_No, Works_Op_No, Alternate_Pref and Op_Proc_No. Deleted records will be recorded in the table Works_OP_Char_Rota_Excluida.

I did not offer an opinion.
You have what is called a technical or program specification. It describes the programming steps that need to be designed and written. This is exactly what programmers do. And your seeming inability to do this, points to the fact that you are not a programmer. That is the issue you need to address - instead of looking for so-called algorithmic logic.
Simple and basic approach. Take step 1. Write SQL code that satisfies the requirements and outputs of that step. E.g.
Step 1: Find Table MP_WO_REP which records have sales order number 18669437-20.
Code: select * from mp_wo_rep where sales_order = '18669437-20'
Do the same for step 2. And the remaining steps
You now have the basic code template required to perform these steps. The next actions are:
Modularising the code (instead of a hardcoded sales order number, support specifying it as a parameter).
Simplify the code (by combining and integrating processing steps). Real programming is said to be the act of removing program source code statements, and not writing them.

Cooley turkey FFT Algorithm Help

Hello fellow java people, I am trying to understand the adaptation of the cooley Turkey algorithm in the link below.
http://www.cs.princeton.edu/introcs/97data/FFT.java.html
One of the main things that i dont understand is the complex object which is being used. I may have overlooked it when I was reviewing the code but I cannot see the complex object anywhere.
Can someone please tell me where if any where it is defined as I need to know what the input for this algorithm would be.
Cheers in advance

found out by myself, complex.java in different part.

Simple algorithm help to replace hardcoding

How can this be simplified into simple algorithm?
public void AI() {
        count++;
        if (count > 4 && randomMoveDecider() == true) {
            randomMove();
        } else if (buttons[1].getText().equals("O") && buttons[2].getText().equals("O") && buttons[3].getText().equals("")) {
            buttons[3].setText("O");
            buttons[3].setEnabled(false);
            board.setButton3("O");
        } else if (buttons[4].getText().equals("O") && buttons[5].getText().equals("O") && buttons[6].getText().equals("")) {
            buttons[6].setText("O");
            buttons[6].setEnabled(false);
            board.setButton6("O");
        } else if (buttons[7].getText().equals("O") && buttons[8].getText().equals("O") && buttons[9].getText().equals("")) {
            buttons[9].setText("O");
            buttons[9].setEnabled(false);
            board.setButton9("O");
        } else if (buttons[2].getText().equals("O") && buttons[3].getText().equals("O") && buttons[1].getText().equals("")) {
            buttons[1].setText("O");
            buttons[1].setEnabled(false);
            board.setButton1("O");
        } else if (buttons[5].getText().equals("O") && buttons[6].getText().equals("O") && buttons[4].getText().equals("")) {
            buttons[4].setText("O");
            buttons[4].setEnabled(false);
            board.setButton4("O");
        } else if (buttons[8].getText().equals("O") && buttons[9].getText().equals("O") && buttons[7].getText().equals("")) {
            buttons[7].setText("O");
            buttons[7].setEnabled(false);
            board.setButton7("O");
        } else if (buttons[1].getText().equals("O") && buttons[3].getText().equals("O") && buttons[2].getText().equals("")) {
            buttons[2].setText("O");
            buttons[2].setEnabled(false);
            board.setButton2("O");
        } else if (buttons[4].getText().equals("O") && buttons[6].getText().equals("O") && buttons[5].getText().equals("")) {
            buttons[5].setText("O");
            buttons[5].setEnabled(false);
            board.setButton5("O");
        } else if (buttons[7].getText().equals("O") && buttons[9].getText().equals("O") && buttons[8].getText().equals("")) {
            buttons[8].setText("O");
            buttons[8].setEnabled(false);
            board.setButton8("O");
        } else if (buttons[1].getText().equals("O") && buttons[4].getText().equals("O") && buttons[7].getText().equals("")) {
            buttons[7].setText("O");
            buttons[7].setEnabled(false);
            board.setButton7("O");
        } else if (buttons[2].getText().equals("O") && buttons[5].getText().equals("O") && buttons[8].getText().equals("")) {
            buttons[4].setText("O");
            buttons[4].setEnabled(false);
            board.setButton4("O");
        } else if (buttons[3].getText().equals("O") && buttons[6].getText().equals("O") && buttons[9].getText().equals("")) {
            buttons[9].setText("O");
            buttons[9].setEnabled(false);
            board.setButton9("O");
        } else if (buttons[4].getText().equals("O") && buttons[7].getText().equals("O") && buttons[1].getText().equals("")) {
            buttons[1].setText("O");
            buttons[1].setEnabled(false);
            board.setButton1("O");
        } else if (buttons[5].getText().equals("O") && buttons[8].getText().equals("O") && buttons[2].getText().equals("")) {
            buttons[2].setText("O");
            buttons[2].setEnabled(false);
            board.setButton2("O");
        } else if (buttons[6].getText().equals("O") && buttons[9].getText().equals("O") && buttons[3].getText().equals("")) {
            buttons[3].setText("O");
            buttons[3].setEnabled(false);
            board.setButton3("O");
        } else if (buttons[1].getText().equals("O") && buttons[7].getText().equals("O") && buttons[4].getText().equals("")) {
            buttons[4].setText("O");
            buttons[4].setEnabled(false);
            board.setButton4("O");
        } else if (buttons[2].getText().equals("O") && buttons[8].getText().equals("O") && buttons[5].getText().equals("")) {
            buttons[5].setText("O");
            buttons[5].setEnabled(false);
            board.setButton5("O");
        } else if (buttons[3].getText().equals("O") && buttons[9].getText().equals("O") && buttons[6].getText().equals("")) {
            buttons[6].setText("O");
            buttons[6].setEnabled(false);
            board.setButton6("O");
        } else if (buttons[1].getText().equals("O") && buttons[5].getText().equals("O") && buttons[9].getText().equals("")) {
            buttons[9].setText("O");
            buttons[9].setEnabled(false);
            board.setButton9("O");
        } else if (buttons[5].getText().equals("O") && buttons[9].getText().equals("O") && buttons[1].getText().equals("")) {
            buttons[1].setText("O");
            buttons[1].setEnabled(false);
            board.setButton1("O");
        } else if (buttons[1].getText().equals("O") && buttons[9].getText().equals("O") && buttons[5].getText().equals("")) {
            buttons[5].setText("O");
            buttons[5].setEnabled(false);
            board.setButton5("O");That is only some of it. :(
But the point is for the AI to check the grid on a tic tac toe grid 3/3 and make the best move(win or stop wins)

tjacobs01 wrote:
private boolean buttonTest(JButton button1, JButton button2, JButton button3) {
if (button1.getText().equals("O") && button2.getText().equals("O") && button3.getText().equals("")) {
button3.setText("O");
button3.setEnabled(false);
return true;
return false;Edited by: tjacobs01 on Dec 4, 2009 1:39 PMGreat ;)

WordSearch Solver Algorithm Help

Hello, I am making a WordSearch solver. I have an algorithm, and I have it in code, but I can't figure out why it isn't working.
Basically, I have a `List<List<String>>` that contains the WordSearch. I store that in a class called Grid, and in my Finder method use Grid.look() to find the words. The code is below (sorry for not commenting my code), and I would appreciate it if someone could tell me what is going wrong. The first Point (where each correct letter is) is always right, but none of the other ones are.
Direction.java
package com.wordsearchsolver;
import java.awt.Point;
public final class Direction {
     public static Directions NORTH = Directions.NORTH;
     public static Directions NORTHEAST = Directions.NORTHEAST;
     public static Directions EAST = Directions.EAST;
     public static Directions SOUTHEAST = Directions.SOUTHEAST;
     public static Directions SOUTH = Directions.SOUTH;
     public static Directions SOUTHWEST = Directions.SOUTHWEST;
     public static Directions WEST = Directions.WEST;
     public static Directions NORTHWEST = Directions.NORTHWEST;
     private static enum Directions {
          NORTH, NORTHEAST, EAST, SOUTHEAST,
          SOUTH, SOUTHWEST, WEST, NORTHWEST
     public static Point getDirection(Directions d) {
          Point p = new Point();
          switch (d) {
          case NORTH:
               p.setLocation(0, 1);
               break;
          case NORTHEAST:
               p.setLocation(1, 1);
               break;
          case EAST:
               p.setLocation(1, 0);
               break;
          case SOUTHEAST:
               p.setLocation(1, -1);
               break;
          case SOUTH:
               p.setLocation(0, -1);
               break;
          case SOUTHWEST:
               p.setLocation(-1, -1);
               break;
          case WEST:
               p.setLocation(-1, 0);
               break;
          case NORTHWEST:
               p.setLocation(-1, 1);
               break;
          return p;
}Grid.java
package com.wordsearchsolver;
import java.awt.Point;
import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;
public class Grid {
     private List<List<String>> mapByCollumn;
     private Point index;
     public Grid(List<List<String>> mapByCollumn) {
          this.mapByCollumn = mapByCollumn;
          this.index = new Point(0,0);
     public String traverse(Point p) {
          if ((index.x+p.x) >= 0 && (index.y+p.y) >= 0 && (index.y+p.y) < mapByCollumn.size() && (index.x+p.x) < mapByCollumn.get((index.y+p.y)).size())
               index.setLocation(index.x+p.x, index.y+p.y);
          else return "";
          return mapByCollumn.get(index.y).get(index.x);
     public String look(Point p) {
          if ((index.x+p.x) >= 0 && (index.y+p.y) >= 0 && (index.y+p.y) < mapByCollumn.size() && (index.x+p.x) < mapByCollumn.get((index.y+p.y)).size())
               return mapByCollumn.get(index.y+p.y).get(index.x+p.x);
          return "";
     public List<Point> getStartingPoints(String letter) {
          Iterator<List<String>> mapIterator = mapByCollumn.iterator();
          List<Point> startingPoints = new ArrayList<Point>();
          int mapCount      = 0;
          while (mapIterator.hasNext()) {
               Iterator<String> wordIterator = mapIterator.next().iterator();
               int wordCount      = 0;
               while (wordIterator.hasNext()) {
                    String str = wordIterator.next();
                    if (str.equals(letter))
                         startingPoints.add(new Point(mapCount, wordCount));
                    wordCount++;
               mapCount++;
          return startingPoints;
     public Point getIndex() {
          return index;
     public void setIndex(Point p) {
          index.setLocation(p);
}Finder.java
package com.wordsearchsolver;
import java.awt.Point;
import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;
public class Finder {
     private Grid grid;
     private List<Point> answerList;
     private List<List<String>> mapByCollumn;
     private Point direction;
     protected String word = "";
     public Finder(List<List<String>> mapByCollumn) {
          this.mapByCollumn     = mapByCollumn;
          grid                     = new Grid(mapByCollumn);
          answerList               = new ArrayList<Point>();
     public void find() {
          List<Point> startingPoints = grid.getStartingPoints(""+word.charAt(0));
          Iterator<Point> startingIterator = startingPoints.iterator();
          System.out.println(startingPoints);
          while (startingIterator.hasNext()) {
               Point p = startingIterator.next();
               grid.setIndex(p);
               boolean go = false;
               for (int i = 1; i < word.length(); ++i) {
                    if (!go) {
                    if ((word.charAt(i)+"").equals(grid.look(Direction.getDirection(Direction.NORTH)))) {
                         grid.traverse(Direction.getDirection(Direction.NORTH));
                         answerList.add(grid.getIndex());
                         direction = Direction.getDirection(Direction.NORTH);
                         continue;
                    if ((word.charAt(i)+"").equals(grid.look(Direction.getDirection(Direction.NORTHEAST)))) {
                         grid.traverse(Direction.getDirection(Direction.NORTHEAST));
                         answerList.add(grid.getIndex());
                         continue;
                    if ((word.charAt(i)+"").equals(grid.look(Direction.getDirection(Direction.EAST)))) {
                         grid.traverse(Direction.getDirection(Direction.EAST));
                         answerList.add(grid.getIndex());
                         continue;
                    if ((word.charAt(i)+"").equals(grid.look(Direction.getDirection(Direction.SOUTHEAST)))) {
                         grid.traverse(Direction.getDirection(Direction.SOUTHEAST));
                         answerList.add(grid.getIndex());
                         continue;
                    if ((word.charAt(i)+"").equals(grid.look(Direction.getDirection(Direction.SOUTH)))) {
                         grid.traverse(Direction.getDirection(Direction.SOUTH));
                         answerList.add(grid.getIndex());
                         continue;
                    if ((word.charAt(i)+"").equals(grid.look(Direction.getDirection(Direction.SOUTHWEST)))) {
                         grid.traverse(Direction.getDirection(Direction.SOUTHWEST));
                         answerList.add(grid.getIndex());
                         continue;
                    if ((word.charAt(i)+"").equals(grid.look(Direction.getDirection(Direction.WEST)))) {
                         grid.traverse(Direction.getDirection(Direction.WEST));
                         answerList.add(grid.getIndex());
                         continue;
                    if ((word.charAt(i)+"").equals(grid.look(Direction.getDirection(Direction.NORTHWEST)))) {
                         grid.traverse(Direction.getDirection(Direction.NORTHWEST));
                         answerList.add(grid.getIndex());
                         continue;
                    else if (go) {
                         if ((word.charAt(i)+"").equals(grid.look(direction))) {
                              grid.traverse(direction);
                              answerList.add(grid.getIndex());
                              continue;
                    answerList.clear();
                    go = false;
                    break;
               if (!answerList.isEmpty()) {
                    answerList.add(0, p);
                    break;
     public List<Point> getAnswerList() {
          return answerList;
}

First, that's way too much code. You should be writing and testing individual small pieces independently, and then hooking them together once they work. It's much easier to find a problem in a small bit of code than in a lot of code. Narrow down where the problem is occurring and provide an [url http://sscce.org]SSCCE that demonstrates it.
Second, all you've said is "doesn't work." You need to provide details about exactly what is going wrong.

Quick-Sort Algorithm HELP !!!

hi there, I wrote a method to sort an 2D-Vector. I used the Bubble-Algorithm.
Here the code:
Vector == [Micky, Niko, Tete] ; [Lilo, Eli, Micha];
public static void bubbleSort( Vector v,
int sortColumn,
boolean ascending )
int i = 0,
j = 0,
length = v.size();
Vector tmp1,
tmp2;
for (i = 0; i < (length - 1); i++)
for (j = i+1; j < length; j++)
tmp1 = (Vector) v.elementAt(i);
tmp2 = (Vector) v.elementAt(j);
if (SortUtil.isGreaterThan(tmp1.elementAt(sortColumn), tmp2.elementAt(sortColumn)) > 0)
// swap
SortUtil.swap2D(v, i, j);
public class SortUtil
public static int isGreaterThan(Object obj1, Object2)
// String
if ( (obj1 instanceof String) && (obj2 instanceof String) )
return ( ((String) obj1).compareTo((String) obj2) );
public static void swap2D(Vector v, int i)
Vector tmp = (Vector) v.elementAt(i);
v.setElementAt((Vector) v.elementAt(i+1), i);
v.setElementAt(tmp, i+1);
I want now to write a method to use the quick-sort-algorithm.
How can I do this.
thanks a lot.
micky z.

Hi
You can use java.util.Arrays.sort() method to sort an array of data in quick sort algo. May be you will have to use a n array insted of the Vector.
Use vector.toArray() method to get an array from the vector.
But if you want to use a dynamically resizing container like the Vector, use a java.util.LinkedList insted of the Vector and use Collections.sort() method
Good luck.

Signal Algorithm help

I have two signals.
Signal 1: 0-5V trigger signal. During the time duration of interest, the trigger will go high 4 times for 1ms each. In my software, I need to find the last trigger, which I can do easily.
Signal 2: From about 0 to 30ms, the signal is noise with level +- 40mV. From about 30ms and up, the signal is noise with level +-5mV.
I am suposed to find the time dfference between when the last trigger of signal 1 occurs and when signal 2 becomes +-5mV.
I tried to do this by flipping the two signal arrays and find the elements in the arrays where specified thresheds are crossed. Of course, the threshold for signal one is dffierent than signal 2. The described approach only works 50% of the times. The method fails when ignal 2 has spikes during the +-5mV period, which occurs once in a while.
Any inputs on algorithm? Thanks! See attached for a pictorial explaination
Kudos and Accepted as Solution are welcome!
Attachments:
signal.PNG ‏41 KB

Attached is my attempt at the problem. I introduced a guard band on my search. I only ran a few test cases, and I will try it out tomorrow. If you have better ideas, let me know. Thanks!
Kudos and Accepted as Solution are welcome!
Attachments:
signalsearch.PNG ‏1379 KB

Algorithm help needed for electrically charged metallic sphere simulation

I am making a simulation program using Java which takes into account the gravity, air resistance as well as electrical forces of the two charged metal spheres.
The user can input/select:
1) The initial velocity for each metallic sphere
2) The variables in g = MG/(r+h)^2 Newton's law of gravitation (so gravity is SLIGHTLY different per metallic sphere depending on the height from the surface of the Earth - assuming the user chooses Earth)
3) Metallic spheres' charges
4) Dielectric constant
5) Separation distance
6) Drag coefficient
7) Radius of metallic spheres
8) Horizontal position
9) Mass of metallic spheres
10) Vacuum
11) Air
12) Other medium
My question is: How do I make it so that these change over time where the time is determined by a javax.swing.Timer object? In other words, I want the Timer object to change at least one thing which will then change something else and cause a chain reaction such that when the metallic spheres are drawn, there is motion hence it becomes an animation.
I just need the initial push to get started because I haven't yet "seen the light". So I would appreciate it very much if someone could help me see how to change the very first datum that will cause a domino-effect and then the animation.
Thanks in advance!

Ok so this is what I'm planning to do but just wanted to know if it's the best way to go about it:
a = v/s => g = v/s (where g is not a constant but varies very slightly)
and then v = gs and update the velocity every 100 milliseconds. (0.1 seconds).
before re-updating the velocity again I am planning to update the position (I'm not thinking about other stuff yet) based on the velocity via:
v = p/s => vs = p
where for all cases s is seconds s = s+100milliseconds if whoever you are reading this right now didn't know for whatever reason.

Search Algorithms help

Hi, im a new to java, so dont know much. Can anypne help me with wrtting a basic prog to preform a Sequential Search or Binary Search, with the output to be entered by the user eiter using JPane or command line.
thanks.

Hi there,
For the Sequential search you need just a for loop.
e.g. for a String array
public class serc
public static void main(String[] args)
    String[] A={"hi","there","how","are","you"};
    String search="how"; //We are searching "how"
    for(int i=0;i<A.length;i++)
      if (A.equals(search))
System.out.println(A[i]);
break;
For the binary sarch try this. Modify it according to your needs.
public class serc
public static void main(String[] args)
    int[] A=new int[]{1,2,3,4,5,6}; //The array has to be sorted
    int search=5; //We are searching "5"
    int found=ser.search(A,search,0,A.length);
    System.out.println(found);   //if found it will be printed it's position
   found=ser.search(A,3,0,A.length);
    System.out.println(found);   //if found it will be printed it's position
class ser
public static int search(int[] a,int s,int start,int end)
    int m=(int)((start+end)/2);
    if (a[m]==s)
      return m;
    else if(a[m]>s)
      return ser.search(a,s,0,m);
    else
      return ser.search(a,s,m,end);
}If you need explanation, just ask for it.
Hope this helped

Algorithm help

Similar Messages

Maybe you are looking for