on3

  1. C

    an O(1) algorithm will be superior to an O(n3) algorithm in every core?

    it is a question about data structures , i would like to know the answer before 3rd please help me for my external exam thanks
  2. A

    Use the substitution method to show that; T(n)=T(n-1) + n2 is O(n3)?

    Use the substitution method to show that; T(n)=T(n-1) + n^2 is O(n^3)
    • AzazVava
    • Thread
    • method on3 show substitution tntn1
    • Replies: 0
    • Forum: Satellite
  3. S

    Use the substitution method to show that; T(n)=T(n-1) + n2 is O(n3)?

    Use the substitution method to show that; T(n)=T(n-1) + n^2 is O(n^3)
  4. J

    Will a O(n) algorithm generally always win in a time-race over a O(n3) algorithm?

    n3 is n to the third I suppose 0 would make the two equal, is that only exception?
    • Jakk
    • Thread
    • algorithm generally on3 timerace win
    • Replies: 2
    • Forum: Satellite
  5. W

    A function that is O(n2) and O(n3).?

    can anyone give me an example of a function that is both O(n2) and O(n3).
  6. W

    A function that is O(n2) and O(n3).?

    can anyone give me an example of a function that is both O(n2) and O(n3).
Back
Top