Help with algorithm

HI !
I need your help please.
I have a series of n real numbers.
I need to find the max sub-series (I mean the sub-series that its sum is the
max).
I need to find the first index and the last index of this sub series.
Can you help me
and tell me how can I do this ?
Thank you
Gil

So the brute force method has polynomial time complexity [around O(n^3) intuitively], case closed!Spot the complexity theorist. Satisfied with n^3.
I propose a divide and conquer approach. Of the pairs of consecutive numbers which are one positive and one negative, choose that which is nearest the middle of the list. For the left half, find the optimal subseries recursively, and find the optimal subseries ending at the last element in linear time. For the right half, find the optimal subseries recursively, and find the optimal subseries starting at the first element in linear time. Then the optimal series is either the best from the left, the best from the right, or the concatenation of the ones ending at the join point.
Implementation details: don't subdivide a list all of whose elements are positive: the optimal subseries is the series. Assuming series of zero length are permitted (not specified), the optimal subseries at an end may be the series of zero length. (If not, it may still be, but caution is needed to avoid concatenating two zero length lists).
Running time analysis: worst case (actually, I'm not sure it's possible, but I'm being pessimistic) - T(n) = O(n) + 2T(n-1). Exponential. Best case: O(n) (all elements positive). Average case: T(n) = O(n) + 2T(n/2)? If so, O(n lg n).
If anyone can be bothered to bring down the worst case time estimate, I'd be interested to see what they can obtain. It's fairly clear that a bad split one time constrains how bad one of the splits from the recursive calls can be, so it's not obvious that exponential time will ever result.

Similar Messages

Help with algorithm design

You are given an array of n keys, each with one of the values red, white, and blue.
Give an O(n) algorithm for rearranging the keys so that all the reds come before all the whites,
and all the whites come before all the blues. The only operations permitted are examination
of a key to nd out what color it is, and swap of two keys

Rahulm5000 wrote:
You are given an array of n keys, each with one of the values red, white, and blue.
Give an O(n) algorithm for rearranging the keys so that all the reds come before all the whites,
and all the whites come before all the blues. The only operations permitted are examination
of a key to nd out what color it is, and swap of two keys1. Put the keys one-at-a-time in a magical box -- O(n)
2. Shake -- O(1).
Or, if you lost your magical box, here's a start:
{noformat}
Cursors l <- first element, r <- last element
do:
   while l isn't blue, l++
   while r is blue, r--
   swap l, r
while l < r
repeat for white.
{noformat}It really is simple to create and prove an algorithm to be O(n) in this case, since the number of options is a constant, and is therefore irrelevant. If there were m colours, this approach would be O(n*m), but there arent.
Edited by: endasil on 27-Oct-2009 11:58 PM

Help with algorithm about distrbuting numbers in a matrix

Hi,
I have to do the following:
I need to distribute N numbers in a (Y,N) matrix. The only problem is that each number should be unique on its row and its column (sth like sudoku). Number N is always the same as the columns.
For example in a simple situation where there are 3 rows and 3 columns I should distribute 1, 2 and 3 like this (in rows): 1,2,3 - 2,3,1 - 3,1,2
Rows should always be less than or equal number of columns.
Any help would be appreciated.

Here's my go: no claim how good it is.
Start off with the matrix filled with a basic
rotation:
12345
23451
34512
45123
51234Then shuffle. Repeatedly:
1. Randomly choose to swap rows or cols.
2. Randomly pick a pair of rows/cols. Swap them.
For example, swapping the first and last row on
the original matrix yields:
51234
23451
34512
45123
12345
this sounds nice and easy. At the moment I am trying to do the following (which I am sure is bad) : a while (true) loop that picks a random number and random place and checks horizontally and vertically if it is ok to put the number in the randomly chosen place if not then another place is chosen. This is really time consuming though.

Need help with algorithm for my paint program

I was making a paint program with using a BufferedImage where the user draws to the BufferedImage and then I draw the BufferedImage onto the class I am extending JPanel with. I want the user to be able to use an undo feature via ctrl+z and I also want them to be able to update what kind of paper they're writing on live: a) blank paper b) graph paper c) lined paper. I cannot see how to do this by using BufferedImages. Is there something I'm missing or must I do it another way? I am trying to avoid the other way because it seems too demanding on the computer but if this is not do-able then I guess I must but I feel I should ask you guys if what I am doing is logical or monstrous.
What I am planning to do is make a LinkedList that has the following 4 parameters:
1) previous Point
2) current Point
3) current Color
4) boolean connectPrevious
which means that the program would basically draw the instantaneous line using the two points and color specified in paintComponent(Graphics g). The boolean value is for ctrl+z (undo) purposes. I am also planning to use a background thread to eliminate repeated entries in the LinkedList except for the last 25 components of the LinkedList (that number might change in practice).
What do you guys think?
Any input would be greatly appreciated!
Thanks in advance!

Look at the package javax.swing.undo package - UndoableEdit interface and UndoManager class.
Just implement the interface. Store all necessary data to perform your action (colors, pixels, shapes etc.). Add all your UndoableEdits in an UndoManager instance and call undo() redo() when you need.

Help with algorithm analysis...

Big-Oh O(f(n)) means that T(n) <= O(f(n)) (meaning that at this level the growth rate (T(n)) is bounded on top by the growth function f(n))
Big-Omega (f(n)) means that T(n) >= f(n) (meaning that at this level the growth rate is bounded on the bottom by the growth of this function)
Big-Theta (f(n)) means that T(n) = f(n) (meaning that at this level the growth rate is equal to the growth of this function)
Little-Oh (f(n)) means that T(n) < f(n).
OK, here is my question:
Suppose T1(n) = O(f(n)) and T2(n) = O(f(n)). Prove or disprove the
following. { Disprove by a counter-example. }
a) T1(n) - T2(n) = o(f(n))
b) T1(n)/T2(n) = O(1) // Trick Question - Be careful
I think that a) is true but I just cant prove it...It's just the math that doesnt come to me...
If you guys know or can give me any clue, I would really appreciate it...TIA

Hey thx guys...nikita could you give me an example in how to do it the way u think should be done...I know that this is the way to do it but I cant figure out in my head what functions to use or how to use them. Once again thx for your time.

Please help with tricky query

I need help with SQL query (if it can be accomplished with query at all).
I'm going to create a table with structure similar to:
Article_Name varchar2(30), Author_Name varchar2(30), Position varchar2(2). Position field is basicly position of an article author in the author list, e.g. if there is one author, his/her position is 0, if 2, then 1st author is 0, second is 1, etc.
Article_Name Author_Name Position
Outer Space Smith 0
Outer Space Blake 1
How can I automate creation of Position, based on number of authors on the fly? Let's say I have original table without Position, but I want to create a new table that will have this information.
Regards

If you have an existing table whose structure doesn't tell you what position the author is in, what's the algorithm you'd use to determine who was the first author, the second author, etc? If you issue a select query on a table without providing an "order by" clause, Oracle makes no guarantees about the order in which it retrieves rows.
As an aside, why would you store position number in a varchar2 field? If it's a number, it ought to be stored as a number.
Justin

Help with Switch statements using Enums?

Hello, i need help with writing switch statements involving enums. Researched a lot but still cant find desired answer so going to ask here. Ok i'll cut story short.
Im writing a calculator program. The main problem is writing code for controlling the engine of calculator which sequences of sum actions.
I have enum class on itself. Atm i think thats ok. I have another class - the engine which does the work.
I planned to have a switch statement which takes in parameter of a string n. This string n is received from the user interface when users press a button say; "1 + 2 = " which each time n should be "1", "+", "2" and "=" respectively.
My algorithm would be as follows checking if its a operator(+) a case carry out adding etc.. each case producing its own task. ( I know i can do it with many simple if..else but that is bad programming technique hence im not going down that route) So here the problem arises - i cant get the switch to successfully complete its task... How about look at my code to understand it better.
I have posted below all the relevant code i got so far, not including the swing codes because they are not needed here...
ValidOperators v;
public Calculator_Engine(ValidOperators v){
          stack = new Stack(20);
          //The creation of the stack...
          this.v = v;
public void main_Engine(String n){
     ValidOperators v = ValidOperators.numbers;
                *vo = vo.valueOf(n);*
     switch(v){
     case Add: add(); break;
     case Sub: sub(); break;
     case Mul: Mul(); break;
     case Div: Div(); break;
     case Eq:sum = stack.sPop(); System.out.println("Sum= " + sum);
     default: double number = Integer.parseInt(n);
                   numberPressed(number);
                   break;
                  //default meaning its number so pass it to a method to do a job
public enum ValidOperators {
     Add("+"), Sub("-"), Mul("X"), Div("/"),
     Eq("="), Numbers("?"); }
     Notes*
It gives out error: "No enum const class ValidOperators.+" when i press button +.
It has nothing to do with listeners as it highlighted the error is coming from the line:switch(v){
I think i know where the problem is.. the line "vo = vo.valueOf(n);"
This line gets the string and store the enum as that value instead of Add, Sub etc... So how would i solve the problem?
But.. I dont know how to fix it. ANy help would be good
Need more info please ask!
Thanks in advance.

demo:
import java.util.*;
public class EnumExample {
    enum E {
        STAR("*"), HASH("#");
        private String symbol;
        private static Map<String, E> map = new HashMap<String, E>();
        static {
            put(STAR);
            put(HASH);
        public String getSymbol() {
            return symbol;
        private E(String symbol) {
            this.symbol = symbol;
        private static void put(E e) {
            map.put(e.getSymbol(), e);
        public static E parse(String symbol) {
            return map.get(symbol);
    public static void main(String[] args) {
        System.out.println(E.valueOf("STAR")); //succeeds
        System.out.println(E.parse("*")); //succeeds
        System.out.println(E.parse("STAR")); //fails: null
        System.out.println(E.valueOf("*")); //fails: IllegalArgumentException
}

Need help with Go Pro Hero 3 and Premiere Pro CS6

Hello,
I recently acquired PP CS6. I put my clip (30 seconds long) and I go to preview while editing, for the first 1.5 seconds it is fine but then it is very choppy. The audio is fine but the video does not play smoothly. When I save and process the video it is fine. It is frustrating to try to edit video this way. I'm sure I'm missing a step when creating the project but I haven't used Premiere Pro since CS6. This is only happening with Go Pro Hero 3 videos, any of my other cameras are fine. Any ideas? Thanks

There's a lot of confusion over how video encoding affects subsequent editing performance - a higher data rate has no direct relation to how much effort is required to decode and play the footage, in fact a higher data rate often makes playback easier - which is why transcoding to AVI can help with playback even though the files can be hundreds of times larger. Data rates with the same codec depend on the frame contents and recording quality, but for playback and editing what matters is the GOP (group-of-pictures) structure and the complexity of the encoding algorithm. Provided your disks are fast enough the data rate is immaterial to Premiere.
With long-GOP files (as typically created by consumer DSLRs and helmet cams) we have keyframes (I-frames) with a complete set of pixel data, then a series of intervening P- and B-frames which only store the difference between 'now' and 'one frame before' or 'one frame after'. Unless you're on an I-frame you have to calculate the chain of differences from the nearest I-frame, and when editing or applying an effect we must re-calculate the entire GOP, so Premiere has to hold a lot of data in the buffer. Remember all timelines in Premiere are internally transcoded to 32-bit floating point, so it's more work to 'play' the footage in the monitors than would be done by a simple playback-only application such as VLC, or in some other brands of NLE that only work in the footage's color space. Premiere's hardware acceleration (MPE) only kicks in once the buffer has been ingested, all the decoding of the original H.264 frames happens in your CPU.
With digital cinema cameras and some hacked DSLRs, we record "all-I" footage - so there's no GOP overhead and playback/editing is massively smoother. I can scrub all-I footage from a hacked 7D no problem on my relatively-ancient spare laptop, but the long-GOP files from a factory 7D struggle to play at all. Our all-I 7D footage can hit 300MBit/s compared to 35 for long-GOP. Helmet cams such as the GoPro do all they possibly can to squeeze data onto their storage cards, which means they have long-GOP codecs that have some of the most complicated compression algorithms out there. The Hero3's implementation of H.264 uses the Ambarella chip, whose files are very small but an utter nightmare to decode - hence far more of a demand on your CPU than an equivalent clip from a DSLR.
Jim Simon wrote:
Might be the 35 Mbps that is causing the choppy playback.
It shouldn't, assuming sufficient hardware. My GH2 clips often get up to over 90 Mb/s and play just fine on an older i7 920.

Need help with this Pascal Triangle code....

Hey everyonr i am totally new to Java... so need your help with this code...
the function makeRows gives me problems... main is correct ... can someone fix my makeRows... i don't see what's wrong
public class Pascal {
/** Return ragged array containing the first nRows rows of Pascal's
   * triangle.
public static int[][] makeRows(int nRows) {
        int[][] mpr = new int[nRows+1][];
        int l=0; int r=0;
        for (int row = 0; row < nRows; row++) {
          mpr[row] = new int[row+1]; //index starts at 0
          if (row==0) {
            mpr[0][0]= 1;
                if (row==1) {
            mpr[1][0]= 1;
            mpr[1][1]= 1;
          if (row>=2) {
             for (int j = 0; j <= row; j++) {
                if (j==0)               {l=0;} else {l=mpr[row-1][j-1];}
                if (j==mpr[row].length-1) {r=0;} else{r=mpr[row-1][j];}
                mpr[row][j] = l + r;
        return mpr;
public static void main(String[] args) {
         if (args.length != 1) {
           System.out.println("usage: java " + Pascal.class.getName() + " N_ROWS");
           System.exit(1);
         int nRows = Integer.parseInt(args[0]);
         if (nRows > 0) {
           int[][] pascal = makeRows(nRows);
           for (int[] row : pascal) {
          for (int v : row) System.out.print(v + " ");
          System.out.println("");
     }this makeRows function should return ragged array containing the first nRows rows of Pascal's triangle
thanks
Edited by: magic101 on May 9, 2008 4:03 PM

magic,
i think corlettk meant that some people might not know what pascal's triangle is.
also, you didnt say what was wrong with your code, just that it was wrong.
asking smart questions is about giving as much information you can to get the
best answer. i would throw a System.out.print between every line of your
algorithm. i would also supply us with the values you are getting for each row.
also, this question is asked all the time here. do a forum search.
1
11
121
1331
14641

Please help with Berkeley DB, desperate student here

I am a student and I have to complete a project within a week. Problem is, I never used Berkeley DB. What I am supposed to do is this...
Basically, in the Berkeley DB, I need to implement a replication scheme for distributed real-time databases.
The replication scheme simply allows a database which needs temporal data from another database to create a local replica of the data needed from the other database, and to receive the data in constant updates for a specified period of time. This scheme is beneficial because it eliminates the transmission delays from asking for the data every time it needs it from the remote datavabase. The recipient database will not need to keep sending a request for the data, it will automatically be sent to the replica in specified time increments, and for a specified period of time depending on what the transaction specifies.
The DB must support transactions. This is ideally meant for real time databases too.
Could you please tell me who could help me implement this? I really need help with this as soon as possible. I don't know where to get started regarding installing the correct DB, starting it up, and putting in sample data. I need a accurate step by step instruction for which DB to install, how to install it, and how to install sample data and how to access the data, and then how to proceed to modify it so that it can support the replication I mentioned above. Everything. I am new to this. ANyone's help would be the best. Thank you.

Alan, thanks for chiming in. I am in the process of reading the link you posted. Thank you. At this point, after having installed Berkeley DB 4.5.20, are there some preliminary steps that you can outline for me in terms of setting up a sample database and getting started? Is there a step-by-step somewhere on the site? After I do that, and then study the link you sent, it is my intent to dive into the code and make the adjustments/additions I need to model the algorithm I need to accomplish.
Disregard my time constraint which I mentioned earlier. I simply need to get everything running as a workable DB with data at this point, and then I can dive into the replication material. Let me know, and thanks for your help.
Ron, sorry for the multiple posts. I was initially trying to post in categories which I believed were relevant to my situation. I will stick to this thread.

Help with Minimum Spanning Tree

Hello, I need some help with Kruskal's Algorithm, Thanks. This is the link:
http://forum.java.sun.com/thread.jsp?forum=31&thread=325804&tstart=0&trange=15

I don't think the error is mine. I copied the link just as it shows on the address bar.
http://forum.java.sun.com/thread.jsp?forum=31&thread=325804

Need help with "Shield" on side scrolling shooter game

I am horribly new to Flash, and I need lots of help with a lot of things, most notably a shield I'm trying to give the player in a side scrolling shooter game. I need help with:
1. Making the ship change color when it's activated.
2. Making it so enemies die on contact with the ship.
3. Making the "shield" variable go down constantly while in use.
If anyone could help, I would appreciate it a lot.

I wouldn't want any of you to write this program for me because I want to learn it myself. Yes I'm a student and I have to write some game with my groupe for a telephone in java like language doja. We decided to let it be a chess game. However I'm looking for an already written game in java that preferebly has some comments above the program lines so I can see what they've done. Offcourse if nobody has anything like this, yes I'm looking for a way to make an algorithm that makes the cpu move each time the player makes it's move. I have no idea on how to do this. I was hoping it can be solved with for, while, if and genest for statements. Yes it wil be a game with graphics but I think we can manage that part ourselves. So main question is the algorithm for the cpu moves. Do I have to pre-program every game in the book or is there another way etc..
I hope there's anybody that can and is willing to get me on my way since I know it maybee isn't the most simple question.

Help with if statement in cursor and for loop to get output

I have the following cursor and and want to use if else statement to get the output. The cursor is working fine. What i need help with is how to use and if else statement to only get the folderrsn that have not been updated in the last 30 days. If you look at the talbe below my select statement is showing folderrs 291631 was updated only 4 days ago and folderrsn 322160 was also updated 4 days ago.
I do not want these two to appear in my result set. So i need to use if else so that my result only shows all folderrsn that havenot been updated in the last 30 days.
Here is my cursor:
/*Cursor for Email procedure. It is working Shows userid and the string
You need to update these folders*/
DECLARE
a_user varchar2(200) := null;
v_assigneduser varchar2(20);
v_folderrsn varchar2(200);
v_emailaddress varchar2(60);
v_subject varchar2(200);
Cursor c IS
SELECT assigneduser, vu.emailaddress, f.folderrsn, trunc(f.indate) AS "IN DATE",
MAX (trunc(fpa.attemptdate)) AS "LAST UPDATE",
trunc(sysdate) - MAX (trunc(fpa.attemptdate)) AS "DAYS PAST"
--MAX (TRUNC (fpa.attemptdate)) - TRUNC (f.indate) AS "NUMBER OF DAYS"
FROM folder f, folderprocess fp, validuser vu, folderprocessattempt fpa
WHERE f.foldertype = 'HJ'
AND f.statuscode NOT IN (20, 40)
AND f.folderrsn = fp.folderrsn
AND fp.processrsn = fpa.processrsn
AND vu.userid = fp.assigneduser
AND vu.statuscode = 1
GROUP BY assigneduser, vu.emailaddress, f.folderrsn, f.indate
ORDER BY fp.assigneduser;
BEGIN
FOR c1 IN c LOOP
IF (c1.assigneduser = v_assigneduser) THEN
dbms_output.put_line(' ' || c1.folderrsn);
else
dbms_output.put(c1.assigneduser ||': ' || 'Overdue Folders:You need to update these folders: Folderrsn: '||c1.folderrsn);
END IF;
a_user := c1.assigneduser;
v_assigneduser := c1.assigneduser;
v_folderrsn := c1.folderrsn;
v_emailaddress := c1.emailaddress;
v_subject := 'Subject: Project for';
END LOOP;
END;
The reason I have included the folowing table is that I want you to see the output from the select statement. that way you can help me do the if statement in the above cursor so that the result will look like this:
emailaddress
Subject: 'Project for ' || V_email || 'not updated in the last 30 days'
v_folderrsn
v_folderrsn
etc
[email protected]......
Subject: 'Project for: ' Jim...'not updated in the last 30 days'
284087
292709
[email protected].....
Subject: 'Project for: ' Kim...'not updated in the last 30 days'
185083
190121
190132
190133
190159
190237
284109
286647
294631
322922
[email protected]....
Subject: 'Project for: Joe...'not updated in the last 30 days'
183332
183336
[email protected]......
Subject: 'Project for: Sam...'not updated in the last 30 days'
183876
183877
183879
183880
183881
183882
183883
183884
183886
183887
183888
This table is to shwo you the select statement output. I want to eliminnate the two days that that are less than 30 days since the last update in the last column.
Assigneduser....Email.........Folderrsn...........indate.............maxattemptdate...days past since last update
JIM.........      jim@ aol.com.... 284087.............     9/28/2006.......10/5/2006...........690
JIM.........      jim@ aol.com.... 292709.............     3/20/2007.......3/28/2007............516
KIM.........      kim@ aol.com.... 185083.............     8/31/2004.......2/9/2006.............     928
KIM...........kim@ aol.com.... 190121.............     2/9/2006.........2/9/2006.............928
KIM...........kim@ aol.com.... 190132.............     2/9/2006.........2/9/2006.............928
KIM...........kim@ aol.com.... 190133.............     2/9/2006.........2/9/2006.............928
KIM...........kim@ aol.com.... 190159.............     2/13/2006.......2/14/2006............923
KIM...........kim@ aol.com.... 190237.............     2/23/2006.......2/23/2006............914
KIM...........kim@ aol.com.... 284109.............     9/28/2006.......9/28/2006............697
KIM...........kim@ aol.com.... 286647.............     11/7/2006.......12/5/2006............629
KIM...........kim@ aol.com.... 294631.............     4/2/2007.........3/4/2008.............174
KIM...........kim@ aol.com.... 322922.............     7/29/2008.......7/29/2008............27
JOE...........joe@ aol.com.... 183332.............     1/28/2004.......4/23/2004............1585
JOE...........joe@ aol.com.... 183336.............     1/28/2004.......3/9/2004.............1630
SAM...........sam@ aol.com....183876.............3/5/2004.........3/8/2004.............1631
SAM...........sam@ aol.com....183877.............3/5/2004.........3/8/2004.............1631
SAM...........sam@ aol.com....183879.............3/5/2004.........3/8/2004.............1631
SAM...........sam@ aol.com....183880.............3/5/2004.........3/8/2004.............1631
SAM...........sam@ aol.com....183881.............3/5/2004.........3/8/2004.............1631
SAM...........sam@ aol.com....183882.............3/5/2004.........3/8/2004.............1631
SAM...........sam@ aol.com....183883.............3/5/2004.........3/8/2004.............1631
SAM...........sam@ aol.com....183884.............3/5/2004.........3/8/2004............     1631
SAM...........sam@ aol.com....183886.............3/5/2004.........3/8/2004............     1631
SAM...........sam@ aol.com....183887.............3/5/2004.........3/8/2004............     1631
SAM...........sam@ aol.com....183888.............3/5/2004.........3/8/2004............     1631
PAT...........pat@ aol.com.....291630.............2/23/2007.......7/8/2008............     48
PAT...........pat@ aol.com.....313990.............2/27/2008.......7/28/2008............28
NED...........ned@ aol.com.....190681.............4/4/2006........8/10/2006............746
NED...........ned@ aol.com......95467.............6/14/2006.......11/6/2006............658
NED...........ned@ aol.com......286688.............11/8/2006.......10/3/2007............327
NED...........ned@ aol.com.....291631.............2/23/2007.......8/21/2008............4
NED...........ned@ aol.com.....292111.............3/7/2007.........2/26/2008............181
NED...........ned@ aol.com.....292410.............3/15/2007.......7/22/2008............34
NED...........ned@ aol.com.....299410.............6/27/2007.......2/27/2008............180
NED...........ned@ aol.com.....303790.............9/19/2007.......9/19/2007............341
NED...........ned@ aol.com.....304268.............9/24/2007.......3/3/2008............     175
NED...........ned@ aol.com.....308228.............12/6/2007.......12/6/2007............263
NED...........ned@ aol.com.....316689.............3/19/2008.......3/19/2008............159
NED...........ned@ aol.com.....316789.............3/20/2008.......3/20/2008............158
NED...........ned@ aol.com.....317528.............3/25/2008.......3/25/2008............153
NED...........ned@ aol.com.....321476.............6/4/2008.........6/17/2008............69
NED...........ned@ aol.com.....322160.............7/3/2008.........8/21/2008............4
MOE...........moe@ aol.com.....184169.............4/5/2004.......12/5/2006............629
[email protected]/27/2004.......3/8/2004............1631
How do I incorporate a if else statement in the above cursor so the two days less than 30 days since last update are not returned. I do not want to send email if the project have been updated within the last 30 days.
Edited by: user4653174 on Aug 25, 2008 2:40 PM

analytical functions: http://download-west.oracle.com/docs/cd/B10501_01/server.920/a96540/functions2a.htm#81409
CASE
http://download.oracle.com/docs/cd/B10501_01/appdev.920/a96624/02_funds.htm#36899
http://download.oracle.com/docs/cd/B10501_01/appdev.920/a96624/04_struc.htm#5997
Incorporating either of these into your query should assist you in returning the desired results.

I need help with Sunbird Calendar, how can I transfer it from one computer to the other and to my iphone?

I installed Sunbird in one computer and my calendar has all my infos, events, and task that i would like to see on another computer that i just downloaded Sunbird into. Also, is it possible I can access Sunbird on my iphone?
Thank you in advance,

Try the forum here - http://forums.mozillazine.org/viewforum.php?f=46 - for help with Sunbird, this forum is for Firefox support.

Help with algorithm

Similar Messages

Maybe you are looking for