This is the place to talk about anything to do with computers, and is nothing to do with The Fantasy Thread ....

Honorary founders of The Computer Thread: bobifier, oddball and superpyroman.

I won't say any more because I can't think of anything the slightest bit interesting to say about computers. They're very boring.



Edit:

What do you mean they're boring?

I'll have you know an old computer with the side taken off makes a very effective cat litter tray .

Why does my mouse suddenly "freeze" so that I can't move that little arrow type thingy? Will it unfreeze or do I switch off and start again (as I have been doing)?

**There- that's interesting isn't it?

What Operating System are you using?

Errrrrrr..now it's getting complicated. Do you mean Windows Me..?

That's the one!

Hmm. It could be that your computer is a bit clogged up. It's a dated version of Windows you have there - perhaps try clearing it up a bit - delete old programs that you don't use, or try a disk defragment (Start > Programs > Accessories > System Tools > System Restore)

Why does my laptop hate playing most driving theory CDs, and install itself, then decide it hasn't installed and that the CD isn't in the drive when it really is, and I meet all the preconditions it wants?

This could turn into the computer problems thread haha

I'll give it a go- thanks.

So what's the best uni course to choose? Computer Science or Software Engineering?

If I'm to be an honorary founder, I'll have to have a post on the first page!

Neither -- choose American Studies -- more girls

Sorted!

*Fills out UCAS form*

Shame you can't apply for 2008 entry yet!

Python doesn't work properly in windows

I've got some code that almost works - here is the pseudocode:



Almost works, just doesn't print the prime numbers under ten.

How about the Sieve of Eratosthenes?

Have I missed something?

Just looking it up.

OK, so you could load up an array with all the numbers, and then tick off the elements one by one and write out the ones that are left?

check out http://primes.utm.edu/glossary/page.php?so...eOfEratosthenes

Sorted!

Which sorting algorithm did you use? Quick sort? Bubble sort? Insertion sort? Perhaps you would like to post a code snippet...

I don't use alogrithms...

*dramatically*

I randomise!

*gasps from present company*

That sieve is giving me a headache. I'll try it another time

Save it for the exam - you can write it out then as an example of a "function"

ROFL

I could write it in Whitespace....

*has a look in this thread*

*looks at sieve*

*runs out again*

LOL it's not that hard, you just have to learn to iterate

Well I was thinking that you could load an array with numbers from 1 to 100.

To 'mark' any numbers that are prime, I thought they could be set to 0. So, 1 is immediately set to 0. I can't think then how to test whether k exceeds or is equal to the square root of n. Hmm.

What does n stand for?

I'm still at these blumming prime numbers

Time you did something else completely unrelated then!

Here's my code that ALMOST works. Doesn't write numbers under ten.

Oh...! Mine is completely different to that!

Thought by the looks of it you have different comands to me.

I'd show you mine, but it is saved in linux and my mum told me to restart in Windows so she could go on, but subsequently didn't. I'll show it to all when I am on Linux again.

Priceless!

Compare



and...

Good point...it was 100....changed it to 1000.

What language is thart?

It's Pascal.

I still prefer the sieve!!

So do I. I just couldn't think of a way to do it...granted, I didn't think very hard...

when you say {check for division by other primes}, is that just carrying on as (number MOD 11 <>0) AND (number MOD 13 <>0)

No, there's no need to continue.

It's just like saying that anything that divides into six divides into three. Or anything that divides by 9 also goes into three - it saves effort.

I meant does the code actually carry on testing all the other prime numbers up to 1000?

does it print 121 as prime?

Follow through what it does - It takes in a number. If at any time, the remainder of what's been divided equals zero, then it divides perfectly, which discounts it as a prime number. It takes the else route, and nothing happens. If it gets all the way through, then it's prime.

I see where you're coming from. I'll check my compiled list against a correct list, see if I'm right, and I'll come back to you.

Do I have permission to sink through the floor?

it seems that either you don't fully understand my question or I don't fully understand the answer but wouldn't it be more efficient to somehow say to test it against all the numbers that had previously been identified as primes. I'm not sure how pascal works but could you assign a variable to a prime whenever you find one and then tell it to test against all the previous variables somehow?

very good superpyroman,,, very similar to the sieve algorithm!

I feel like such a fool.

I'll be back - with code!

what's the sieve algorithm?

You could have a list of previous primes and compare it to all of them. That's what I did.

that's what I just said