next »

[allan]

Hello everyone
Am searching for a simple example algorithm that is suitable to be amended according to the
constant execution time paradigm.

and also a proposal to rewrite the algorithm so that the variation in execution time will
be reduced.

Is it possible?
Thanks to you

[Rob Lach]

Uhhh.... what?

[moi]

Is it possible?

no

[nikki]

this is what computer science assignments look like Pierog

well kenny since you also posted this exact same question on programmersheaven.com i thought , let's help that university cheating guy out.

I typed "constant execution time" in Google. Found many answers, so i have to say Yes it's possible.
An integer division seems the 'algorithm' you can amend according to 'bla'
An advice i found through Google is to read the book "Numerical Recipes in C" And mostly the last chapter...

for next week's assignment that'll come up ,i am sure, why don't you atleast try to understand the question, so you could restate the question in a more friendly and english way ?

[allan]

hi nikki
i have been searching it also
and i cant find it
thats why am asking for help here)))

[nikki]

It'd be more educational to try to understand your own question.

Since i haven't studied Computer Science (but Fine Art ) i am not the best guy here to help you do your homework. I could give it a go though.
Your question sounds really complicated. But what it means (I believe) is this:

constant execution time paradigm: execution time is NOT dependent on the arguments.
so for example : algorithm(4,80) takes just as long to execute as algorithm(4000300,6000000)

You must know this beter than i do but isn't that an algorithm that takes 0(N) or something ?

so your second sentence means the same as the first (since "amended according to the
constant execution time paradigm"="variation in execution time will
be reduced." )

well anyway , i believe simple arithmetic are algorithm that suit your need, or simple instructions (goto, cin, cout whatever)

to find the same info i just found type google:"constant execution time" and research it!
success

[Hajo]

I typed "constant execution time" in Google. Found many answers, so i have to say Yes it's possible.
An integer division seems the 'algorithm' you can amend according to 'bla'

Depending on the processor architecture an integer division may take a different number of cycles, depending on the operands. I'm not sure if this is a good example?

Usually the time (complexity) questions need algorithm + data structure to give real answers.

"insert" for a linked list is a constant time operation in most books.

(It's still varying like the integer division, but it does not scale with the size of the list, so it's "constant", while sorting the list is not ...)

[nikki]

I'm not sure if this is a good example?

i beliueve your right and that example was wrong. It was the first link of someone asking the same question on some forum (but a bit more specific).

I was just imagining that you'd come back to your prof. and say "Yep i found it, its GOTO"
that'be a great laugh , and i believe the answer is right.

[brog]

Here is an algorithm with a constant execution time:

Code:

int algorithm(int a)
{
  return 0;
}

[Golds]

Hello everyone
Am searching for a simple example algorithm that is suitable to be amended according to the
constant execution time paradigm.

int CheckIfTheInputIsTheNumberThree(int input)
{
   if(input > 2)
   {
      if(input == 3)
          return 1;
   }
   return 0;
}

This  function runs in constant time.  It will take a number and determine if it is 3 in at most 2 conditional checks

and also a proposal to rewrite the algorithm so that the variation in execution time will
be reduced.

Is it possible?

int CheckIfTheInputIsTheNumberThree(int input)
{
   if(input == 3)
         return 1;

   return 0;
}

Now we check in constant time if the input is 3 in only one conditional check, for all cases.

Thanks to you

[Rob Lach]

this is what computer science assignments look like Pierog

LOL, I guess assignments have changed since I graduated. It just seems so obscurely worded.

[PsySal]

Hello everyone
Am searching for a simple example algorithm that is suitable to be amended according to the
constant execution time paradigm.

and also a proposal to rewrite the algorithm so that the variation in execution time will
be reduced.

Is it possible?
Thanks to you

I call HOMEWORK!