pseudocode

First, just to give a visual idea of what I'm after, here's the closest result (yet not exactly what I'm after) image that I've found: Here's the entire site-reference: http://www.mathematische-basteleien.de/spiral.htm BUT, it doesn't exactly solve the problem I'm after. I would like to store an array of points of a very specific spiral algorithm. The points are evenly distributed The 360 degree cycles have an even gap If I'm not mistaken, the first two points would be: point[ 0 ] = new Point(0,0); point[ 1 ] = new Point(1,0); But where to go from here? The only arguments I'd like to provide

I'm looking for the algorithm of Object.hashCode() . This code is native in Object.java . Is this because (a) the code is in assembly-- never was in Java or any other HLL at all or (b) it simply isn't disclosed ? In either case, I am looking to get hold of the algorithm (pseudo-code or some detailed explanation) of "how hashCode() is calculated"-- what are the params going into its calculation and the calculation itself? Please note: It's the hashCode() of Object i'm looking for-- not another like that of String or hashMap/table . //=============================================================

I am a complete ROOKIE at this so I need some help on it. How would you create uml class diagram and constructors with parameters. for default (no parameters) you do policyholder() for diagram and pseudo-code for parameters would you do the same thing policyholder (policynumber, service class, and customer age) for class diagrams and pseudo-code. It also asked to initialize each attribute to value where an object of this type can be instantiated, If a policy number is not between 1000 and 999 inclusive, then set the policy number to 0. (policy number is attribute) The common way is to write

How can I rewrite the following pseudocode in C++? real array sine_table[-1000..1000] for x from -1000 to 1000 sine_table[x] := sine(pi * x / 1000) I need to create a sine_table lookup table. You can reduce the size of your table to 25% of the original by only storing values for the first quadrant, i.e. for x in [0,pi/2]. To do that your lookup routine just needs to map all values of x to the first quadrant using simple trig identities: sin(x) = - sin(-x), to map from quadrant IV to I sin(x) = sin(pi - x), to map from quadrant II to I To map from quadrant III to I, apply both identities, i.e.

// Find a maximum element in the array. findMax(A) findMaxHelper(A, 0, A.length) findMaxHelper(A, left, right) if (left == right - 1) return A[left] else max1 = findMaxHelper(A, left, (right + left) / 2) max2 = findMaxHelper(A, (right + left) / 2, right) if (max1 > max2) return max1 else return max2 I am having a hard time understanding what is happening in this pseudo-code. Can someone help explain what is happening at each line. I need to understand this code before I can answer the questions. I know that the function findMax calls the helper function findMaxHelper, then findMaxHelper uses

I have this array: int [] myarray = {17, 6, 8}; What is the optimal way to sort this array, in pseudocode? Thanks! I think this should be quite fast (ascending order): if (el1 > el2) Swap(el1,el2) if (el2 > el3) Swap(el2,el3) if (el1 > el2) Swap(el1,el2) adamax This code makes 2 or 3 comparisons and 4 memory records in the worst case, as opposed to another answer (always 3 comparisons and 9 memory records in the worst case). if a[0] < a[1]: if a[1] > a[2]: if a[0] < a[2]: temp = a[1] a[1] = a[2] a[2] = temp else: temp = a[0] a[0] = a[2] a[2] = a[1] a[1] = temp else: # do nothing else: if a[1]

I am trying to create a program that takes a string as an argument into its constructor. I need a method that checks whether the string is a balanced parenthesized expression. It needs to handle ( { [ ] } ) each open needs to balance with its corresponding closing bracket. For example a user could input [({})] which would be balanced and }{ would be unbalanced. This doesn't need to handle letters or numbers. I need to use a stack to do this. I was given this pseudocode but can not figure how to implement it in java. Any advice would be awesome. Update- sorry forgot to post what i had so far.