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.

Similar Messages

Help with image analysis Photoshop CS4 Extended

Hi there - I recently went to the Birmingham NEC photo expo and saw a guy there giving a CS4 extended demo. He showed how at the click of a button a folder of new photos were reduced to a smaller bunch of just the most tack-sharp ones. I can't find out how to do this with my CS4 Extended - can anyone help - or am I just imagining it all :-)))

Sounds interesting.
Did he do that in Photoshop itself or Bridge or Lightroom?
Anyway, I suspect one could maybe achieve something like this in Photoshop with some fairly heavy Scripting, but I suspect the Script would have to actually open the images for analysis …

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.

Can anyone help with vocal analysis

I have a bit of music with a fast MC but i cant make out what he says. I have tried using sound booth but don't know how to use it properly, can anyone help? Either point me in the right direction or I can upload the file for someone to have a go with....

I Have this problem as well on my iPad using ios8. I found it only happened after I downloaded the some free books from the bookstore. I have tried to reset all settings but nothing seems to have worked. any ideas??

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.

Help with data analysis.

Hello, can anyone help me with numbers. I'm trying to get a % of a column that has two data points (Yes, No). I click on the top of column and not sure what to do next. I would like to made a round graft of the % of yes and no's for that column. Thank you.

Kelly,
Create a summary table that counts the responses, and then Select the Count column in the Summary table and Insert a Pie Chart.
The result will look like this:
The expressions in the Summary table are:
In B2: =COUNTIF(Survey :: A, "Yes")
In B3: =COUNTIF(Survey :: A, "No")
Regards,
Jerry

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.

IP - Various problems with BEX Analyser - help would be nice

Hi,
we use IP in combination with BEX analyser. We experience certain problems. Does anyone experienced the same issues mentioned below:
1) if a planning function is executed, it is executed twice when your cursor is within the query itself. If it is outside the query when clicking on the button, it is executed once (like it should).
2) Locking: we don't have locking problems, but from the moment two people lock each other once, they need to close their analyser and re-open it (so logon again) in order to be able to start planning again in a non-locked part. If they just change their selection (to the not-lock part) they remain locked!!!
3) planning function with multiple variables: system cannot retrieve values of all variables.
details of function:
CMD                                               1       EXECUTE_PLANNING_FUNCTION
PLANNING FUNCTION NAME           1      AG10_COPY01
DATA PROVIDER_FILTER                 1     DATA_PROVIDER_1
VAR_NAME                                     1       PROF_CTR
VAR_VALUE                                    1       510
VAR_NAME                                     2     PERIOD
VAR_VALUE                                    2        012
VAR_NAME                                     3       CUSTOMER
VAR_VALUE                                    3     1000
-> following the instruction of the SAP course, in case of multiplle variables they should start from 0 and have an incremental increase. But the system only recognizes the variable with index = 1
regards
D

Dear Dries,
could it be that the variable type you use require a different set of commands?
In general the parameters of the BEx Analyzer follow the rules of the SAp BW 3.5 Webruntime. When reading this detailed documentation you find that depending on the type of variable other names have to be used, e.g. when using a selection option variable you need something line varname_low, varname_high, ...
The documentation can be found in the online-help:
<a href="http://help.sap.com/saphelp_nw04/helpdata/en/07/ff413a3ace7022e10000000a11402f/content.htm">http://help.sap.com/saphelp_nw04/helpdata/en/07/ff413a3ace7022e10000000a11402f/content.htm</a>
Best regards, Olaf Fischer

Need urgent help with communicating with the HP 4155B analyser with Labview

i folks,
I'm currently trying to communicate with our HP 4155B semiconductor pamaremter analyser. I do not have experience with GPIB yet. I have installed the NI VISA.
I was wondering if anyone could help with getting me started on how to start communicating with the device using Labview.
I'm not certain where to start.
Kind regards
Rob

Hi,
Thanks for the help. I now have communication with the instrument.
I was wondering if it's possible to to setup a data measurement (I-V Sweep) and be able to read the measurement data in realtime as it is being measured. So I basically see the graph updating itself on the PC during the measurement.
Is this possible? Could anyone give advice on how I can go about this or are there any examples that can help me understand how to do this?
I'm not completely sure how to initialise the instruemnt for communication and handle VISA WRITEs and READs. within LabView
Best regards
Rob

Big-Oh Notation,algorithm-analysis and running time - aagh headache!

Hey folks,
I was reading about the Big-Oh Notation, algorithm-analysis and running time.
Now, it's all probably very nice - if you get to understand it. Which I don't! Gives me headache! lol
And we're having an exam soon. Hmm. Could someone please help to explain it a bit better please?
Oh and by the way, one of the examples mention something about T(N), which I presume is running time for the size of a problem.
So it said:
"? Running time of a loop =
time taken by the body statement * size of the loop
? Example
for ( i = 1; i <= N; i ++)
c = c + 1;
? body statement takes O(1), the size of the loop is N
? So, this loop has running time T(N) = N * O(1) = O (N).
? More precise ?
? i = 1 takes 1 time unit
? Body statement takes 2 time units
? i <= N takes 1 time unit, i ++ takes 1 time unit
? Totally T (N) = 1 + 1 * (N +1) + 2 * N + 1 * N = 4N + 2 = O(N)
init condition body update
Nested loops
? Nested loops: Analyze them inside out
time take by body statement of innermost loop *
product of the size of all the loops
? Example:
line 1 for ( i = 1; i <= N; i ++)
line 2 for ( j = 1; j <= N; j ++)
line 3 k++;
? line 3 is the body statement in the innermost loop (for-j): takes
O(1).
? size of for-j: N
? size of for-i: N
? So the running time for this nested loops: N*N*O(1) = O(N2 )"
Please help me! I don't understand much of this.
Best Wishes!

Ok. I'll have a look about it - but the question I
had was... like...
what exactly is it that takes N steps? How do I know
what takes O(1) steps
and N steps?Depends on what you're doing. Example: adding an item to a linked list of N elements will always take the same effort: attach it to the end. Whether the list already has 0, 10 or 1000 elements doesn't matter. O(1).
If you want to try and find the maximum value in an array of numbers, you need to look at each number in there. So an array with 1 number takes one look, an array with 100 numbers needs 100 looks and an array with N members needs N looks. O(N).
Does the parametres themselves take a step each? How
many steps does the body (as far as I've understood
it, it's c = c + 1; which is the body) take? And how
long time does it take?That body takes only one step. The question is whether you want to account for the repetition or not. If you don't, it's O(1) . There is no N to take into account. If you count in the repetitions too, you end up with an N - the number of times you call the body. So the effort O to run the body once is O(1), the effort to run it N times using the loop is O(N). It really depends on what the actual action is you want to look at.

Help with encapsulation and a specific case of design

Hello all. I have been playing with Java (my first real language and first OOP language) for a couple months now. Right now I am trying to write my first real application, but I want to design it right and I am smashing my head against the wall with my data structure, specifically with encapsulation.
I go into detail about my app below, but it gets long so for those who don't want to read that far, let me just put these two questions up front:
1) How do principles of encapsulation change when members are complex objects rather than primitives? If the member objects themselves have only primitive members and show good encapsulation, does it make sense to pass a reference to them? Or does good encapsulation demand that I deep-clone all the way to the bottom of my data structure and pass only cloned objects through my top level accessors? Does the analysis change when the structure gets three or four levels deep? Don't DOM structures built of walkable nodes violate basic principles of encapsulation?
2) "Encapsulation" is sometimes used to mean no public members, othertimes to mean no public members AND no setter methods. The reasons for the first are obvious, but why go to the extreme of the latter? More importantly HOW do you go to the extreme of the latter? Would an "updatePrices" method that updates encapsulated member prices based on calculations, taking a single argument of say the time of year be considered a "setter" method that violates the stricter vision of encapsulation?
Even help with just those two questions would be great. For the masochistic, on to my app... The present code is at
http://www.immortalcoil.org/drake/Code.zip
The most basic form of the application is statistics driven flash card software for Japanese Kanji (Chinese characters). For those who do not know, these are ideographic characters that represent concepts rather than sounds. There are a few thousand. In abstract terms, my data structure needs to represent the following.
- There are a bunch of kanji.
   Each kanji is defined by:
   - a single character (the kanji itself); and
   - multiple readings which fall into two categories of "on" and "kun".
      Each reading is defined by:
      - A string of hiragana or katakana (Japanese phoenetic characters); and
      - Statistics that I keep to represent knowledge of that reading/kanji pair.Ideally the structure should be extensible. Later I might want to add statistics associated with the character itself rather than individual readings, for example. Right now I am thinking of building a data structure like so:
- A Vector that holds:
   - custom KanjiEntry objects that each hold
      - a kanji in a primitive char value; and
      - two (on, kun) arrays or Vectors of custom Reading objects that hold
         - the reading in a String; and
         - statistics of some sort, probably in primitive valuesFirst of all, is this approach sensible in the rough outlines?
Now, I need to be able to do the obvious things... save to and load from file, generate tables and views, and edit values. The quesiton of editting values raises the questions I identified above as (1) and (2). Say I want to pull up a reading, quiz the user on it, and update its statistics based on whether the user got it right or wrong. I could do all this through the KanjiEntry object with a setter method that takes a zillion arguments like:
theKanjiEntry.setStatistic(
"on",   // which set of readings
2,      // which element in that array or Vector
"score", // which statistic
98);      // the valueOr I could pass a clone of the Reading object out, work with that, then tell the KanjiEntry to replace the original with my modified clone.
My instincts balk at the first approach, and a little at the second. Doesn't it make more sense to work with a reference to the Reading object? Or is that bad encapsulation?
A second point. When running flash cards, I do not care about the subtlties of the structure, like whether a reading is an on or a kun (although this is important when browsing a table representing the entire structure). All I really care about is kanij/reading pairings. And I should be able to quickly poll the Reading objects to see which ones need quizzing the most, based on their statistics. I was thinking of making a nice neat Hashtable with the keys being the kanji characters in Strings (not the KanjiEntry objects) and the values being the Reading objects. The result would be two indeces to the Reading objects... the basic structure and my ad hoc hashtable for runninq quizzes. Then I would just make sure that they stay in sync in terms of the higher level structure (like if a whole new KanjiEntry got added). Is this bad form, or even downright dangerous?
Apart from good form, the other consideration bouncing around in my head is that if I get all crazy with deep cloning and filling the bottom level guys with instance methods then this puppy is going to get bloated or lag when there are several thousand kanji in memory at once.
Any help would be appreciated.
Drake

Usually by better design. Move methods that use the
getters inside the class that actually has the data....
As a basic rule of thumb:
The one who has the data is the one using it. If
another class needs that data, wonder what for and
consider moving that operation away from that class.
Or move from pull to push: instead of A getting
something from B, have B give it to A as a method
call argument.Thanks for the response. I think I see what you are saying.. in my case it is something like this.
Solution 1 (disfavored):
public class kanjiDrill{ // a chunk of Swing GUI or something
     public void runDrill(Vector kanjiEntries){
          KanjiEntry currentKanjiEntry = kanjiEntries.elementAt(0); // except really I will pick one randomly
          char theKanji = currentKanjiEntry.getKanji();
          String theReading = currentKanjiEntry.getReading();
          // build and show a flashcard based on theKanji and theReading
          // use a setter to change currentKanji's data based on whether the user answers correctly;
}Solution 2 (favored):
public class kanjiDrill{ // a chunk of Swing GUI or something
     public void runDrill(Vector kanjiEntries){
          KanjiEntry currentKanjiEntry = kanjiEntries.elementAt(0); // except really I will pick one randomly
          currentKanji.buildAndShowFlashcard(); // method includes updating stats
}I can definitely see the advantages to this, but two potential reasons to think hard about it occur to me right away. First, if this process is carried out to a sufficient extreme the objects that hold my data end up sucking in all the functionality of my program and my objects stop resembling natural concepts.
In your shopping example, say you want to generate price tags for the items. The price tags can be generated with ONLY the raw price, because we do not want the VAT on them. They are simple GIF graphics that have the price printed on a an irregular polygon. Should all that graphics generating code really go into the item objects, or should we just get the price out of the object with a simple getter method and then make the tags?
My second concern is that the more instance methods I put into my bottom level data objects the bigger they get, and I intend to have thousands of these things in memory. Is there a balance to strike at some point?
It's not really a setter. Outsiders are not setting
the items price - it's rather updating its own price
given an argument. This is exactly how it should be,
see my above point. A breach of encapsulation would
be: another object gets the item price, re-calculates
it using a date it knows, and sets the price again.
You can see yourself that pushing the date into the
item's method is much beter than breaching
encapsulation and getting and setting the price.So the point is not "don't allow access to the members" (which after all you are still doing, albeit less directly) so much as "make sure that any functionality implicated in working with the members is handled within the object," right? Take your shopping example. Say we live in a country where there is no VAT and the app will never be used internationally. Then we would resort to a simple setter/getter scheme, right? Or is the answer that if the object really is pure data are almost so, then it should be turned into a standard java.util collection instead of a custom class?
Thanks for the help.
Drake

How to use SOA Suite in conjunction with SOA Analysis and Design Tools

Hi everybody,
I am a novice in this field and I need some help regarding integrating analysis and design tools with SOA Suite.
We used to analyze and design with Oracle Designer and use its powerful form generator to develop a system. It almost covered all the software lifecycle and kept the traceability between anlaysis,design and implementation.
I have studied about the SOA concepts and read some papaer about SOA Suite. I have also installed the SOA demo based on SOA Suite and I found it absolutely amazing, but my problem is that It seems oracle does not have any tools for SOA Analysis and Design. am I right? if so, How can we analyze and design a system based on SOA concepts and implement it using soa suite in such a way that keeps traceability? What tools is used for this purpose?
It seems that IBM have some tools like Rational Software Architect and Rational Suite which enable people to design and analyze based on SOA concepts and then generates some pieces of code (like oracle designer in old days) but is it possible to design in these tools and then generating codes for SOA Suite ? (for example generating a bpel file from a design model)
As I told before I am a novice in this field and I would be so grateful if other users can share their expriences regarding this matter.
Any help would be highly appreciated.
Thanks in advance,
Navid

Learn About All Things SOA:: SOA India 2007:: IISc, Bangalore (Nov 21-23)
Aligning IT systems to business needs and improving service levels within the constraints of tight budgets has for long been the topmost challenge for CIOs and IT decision makers. Service-oriented Architecture (SOA) provides a proven strategy to clearly address both of these objectives. Creating more agile information systems and making better use of existing infrastructure are two leading factors that are boosting SOA adoption across large, medium, and small Indian industries from the BFSI, Retail, Telecom, Manufacturing, Pharma, Energy, Government and Services verticals in India. If you are an IT decision maker belonging to any of these verticals, SOA India 2007 (IISc, Bangalore, Nov 21-23 2007) presents a unique opportunity to gather cutting-edge business and technical insights on SOA and other related areas such as BPM, BPEL, Enterprise 2.0, SaaS, MDM, Open Source, and more.
At SOA India 2007, acclaimed SOA analysts, visionaries, and industry speakers from across the world will show you how to keep pace with change and elevate your IT infrastructure to meet competition and scale effectively. The organisers are giving away 100 FREE tickets worth INR 5000 each to the first 100 qualified delegates belonging to the CxO/IT Decision Maker/Senior IT Management profile, so hurry to grab this opportunity to learn about all things SOA. You can send your complete details, including your designation, e-mail ID, and postal address directly to Anirban Karmakar at [email protected] to enrol in this promotion that is open until 12 October 2007.
SOA India 2007 will also feature two half-day workshops on SOA Governance (by Keith Harrison-Broninski) and SOA Architecture Deep Dive (by Jason Bloomberg). If you are an IT manager, software architect, project leader, network & infrastructure specialist, or a software developer, looking for the latest information, trends, best practices, products and solutions available for building and deploying successful SOA implementations, SOA India 2007’s technical track offers you immense opportunities.
Speakers at SOA India include:
•     Jason Bloomberg, Senior Analyst & Managing Partner, ZapThink LLC
•     Keith Harrison-Broninski, Independent consultant, writer, researcher, HumanEdJ
•     John Crupi, CTO, JackBe Corporation
•     Sandy Kemsley, Independent BPM Analyst, column2.com
•     Prasanna Krishna, SOA Lab Director, THBS
•     Miko Matsumara, VP & Deputy CTO, SoftwareAG
•     Atul Patel, Head MDM Business, SAP Asia Pacifc & Japan
•     Anil Sharma, Staff Engineer, BEA Systems
•     Coach Wei, Chairman & CTO, Nexaweb
•     Chaitanya Sharma, Director EDM, Fair Isaac Corporation
A partial list of the sessions at SOA India 2007 include:
•     EAI to SOA: Radical Change or Logical Evolution?
•     BPEL: Strengths, Limitations & Future!
•     MDM: Jumpstart Your SOA Journey
•     Governance, Quality, and Management: The Three Pillars of SOA Implementations
•     Building the Business Case for SOA
•     Avoiding SOA Pitfalls
•     SOA Governance and Human Interaction Management
•     Business Intelligence, BPM, and SOA Handshake
•     Enterprise 2.0: Social Impact of Web 2.0 Inside Organizations
•     Web 2.0 and SOA – Friends or Foe?
•     Achieving Decision Yield across the SOA-based Enterprise
•     Governance from day one
•     Demystifying Enterprise Mashups
•     Perfecting the Approach to Enterprise SOA
•     How to Build Cost Effective SOA. “Made in India” Really Works!
For more information, log on to http://www.soaindia2007.com/.

Help with bb curve 9320

Hi I recently bought the 9320 curve and I had to do a security wipe last night and my battery saving mode option has disappeared now and I used to have blackberry device analyser on my device aswell after the security wipe battery saving mode is no longer there and my bb device analyser is showing in my application managment but says not running and its not in my settings no longer could I have help with resolving this issue to get my battery saving mode back and my bb device analayser back all help appreciated cheers.

Hello,
Lacking any punctuation, I'm not sure I quite understand your post...but I think I got at least part of it...this KB might be helpful:
KB31922 BlackBerry Device Analyzer Application is missing on the BlackBerry smartphone
Good luck!
Occam's Razor nearly always applies when troubleshooting technology issues!
If anyone has been helpful to you, please show your appreciation by clicking the button inside of their post. Please click here and read, along with the threads to which it links, for helpful information to guide you as you proceed. I always recommend that you treat your BlackBerry like any other computing device, including using a regular backup schedule...click here for an article with instructions.
Join our BBM Channels
BSCF General Channel
PIN: C0001B7B4 Display/Scan Bar Code
Knowledge Base Updates
PIN: C0005A9AA Display/Scan Bar Code

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 algorithm analysis...

Similar Messages

Maybe you are looking for