First off, I just found this board and I am impressed. It looks like you have a very intelligent community here. Anyways, I am a freshman studying Computer Science at Minnesota. I am in an entry level course for algorithms and information systems. We have a final project that is based around writing a program to find the lowest value for x of a given polynomial equestion, on a given range of numbers ( -5 <= x <= 5).
"Develop an iterative algorithm to the minimum point of this function over a range of -5 to +5.
y=x^2 -8x +30
- A generalized description of the algorithm
- Psuedo code for the algorithm
- Flowchart of the algorithm"
That stuff should be a piece of cake.
Then, the 2nd part is to make a "Little Man" program and write it out longhand, then copy it into an ascii text file named LMC.s
The 3rd part is to make a C program that reads the file LMC.s and convert the source within that file to 8bit binary representation.
Now for my questions. Let me preface this by saying that Im not looking for someone to tell me exactly what i should do for everything. I wouldnt learn that way. I would like some advice to help push me in the right direction, and also some insight on my ideas I mention here:
For the original psuedo code for the algorithm, my idea is to start with -5 and plug it in for X. This would be represented by -5*-5-8*-5+30. Then take that result and compare it to the next one, -4. Then just keep going like that.
Lets just start with the psuedo code. What do you guys think about my plan? Could I possibly run into any issues structuring the algorithm this way?
Thanks in advance,