Counter.java

why the fuck do retards have to invent a goddamned class just to use a goddamned integer? have people no shame?

Counter.java

/**
* A simple counter class that can be initialized to
* a specific value, incremented, and cleared.
* @author Owen Astrachan
*/

public class Counter
{
int myCount;

/**
* Construct a counter whose value is zero.
*/
public Counter()
{
myCount = 0;
}

/**
* Construct a counter with given initial value.
* @param init is the initial value of the counter
*/

public Counter(int init)
{
myCount = init;
}

/**
* Returns the value of the counter.
* @return the value of the counter
*/
public int getValue()
{
return myCount;
}

/**
* Zeros the counter so getValue() == 0.
*/
public void clear()
{
myCount = 0;
}

/**
* Increase the value of the counter by one.
*/
public void increment()
{
myCount++;
}

/**
* Return a string representing the value of this counter.
* @return a string representation of the value
*/

public String toString()
{
return ""+myCount;
}
}

>>10
>>41
protip: computer science is not a course in programming. If you want a course in programming, you do a programming course. Computer science is about the theory of information and computation.

It doesn't even check for an overflow condition. Also, for a voting machine it should have some sort of access control on the count reset.

>>41-nigger was exploded before he could optimise his quotes

>>40
Shalom!

>>42
Zeroed your counter, nida!

def makeInc(x):
def inc(y):
# x is "closed" in the definition of inc
return y + x
return inc

/THREAD

>>46
top kek, you are even dumber than astra-chan.

>>29,31
votes[candidate]++;

OOP and the rest of that ENTERPRISE BULLSHITE is in some way really clever; it makes it far easier for many people to get paid doing what looks like really productive work. It's a great method of expanding work to keep people employed at all costs. A single person with a few days would probably be enough to write the whole software for a voting machine, at very little cost, but when the job is given to some huge company it ends up turning into a bloated monstrosity "requiring" tens or even hundreds of people over months or years and going overbudget, and the product still contains bugs!

You don't even need a database to count votes; assuming there are less than 257 candidates in any single vote, the largest country in the world still requires less than 2GB if every single person in it (and that's including people who can't vote) got a byte to put their choice in.

The costs of running a database - which probably means licensing fees, server costs (disk, OS, power, etc.), and a team of overpaid DBAs and "developers", can be replaced by a single memory device costing less than $10.

Of course they'll probably complain and give all sorts of reasons why a database is "needed", but that's just because they're desperate to keep their jobs... no, I think a DB is absolutely NOT needed for this application. Vote data is vote data. It's created to be counted. It doesn't need anywhere near the processing flexibility that a database gives.

>>48
I love you, Cudder-dono.

>>49
* donna Cudder

>>48
To help protect against voter fraud, there should be some redundancy in the data collected. For worst anonymity, the voter's id is attached to their vote with timestamp and the table is made public. Each voter can confirm their vote. Everyone can perform a recount and that published voters are alive. If someone suspects a voter didn't actually go to the polls, they can contact them and use an alibi to prove voter fraud occurred.

>>50
The -dono honorific is gender-neutral.

>>48
Shalom!

astra-chan also wrote a book which has 4 bad reviews:
http://www.amazon.ca/Computer-Science-Tapestry-Exploring/dp/0071217193/ref=sr_1_2/188-8061510-5158557?s=books&ie=UTF8&qid=1410131723&sr=1-2

>>54

Computer Science with C++
bad reviews

not surprising

>>1
WAT KINDA PLASTIC FISHER'S PRICE RETOID WUD WRITE DAT SHIT? YAINT RED DA FUCKIN STANDARD
#include <stdio.h>

#define MAXDIGITS 3

struct count {
char base[MAXDIGITS + 1];
char *s, *endp;
};

void clear(struct count *countp)
{
countp->s = countp->base + MAXDIGITS - 1;
*countp->s = '0';
countp->endp = countp->base + MAXDIGITS;
*countp->endp = '\0';
}

int increment(struct count *countp)
{
char *p;

for (p = countp->endp; p > countp->s; *p = '0')
if (*--p != '9') {
++*p;
return 0;
}
if (countp->s == countp->base)
return 1;
*--countp->s = '1';
return 0;
}

int main(void)
{
struct count count;

clear(&count);
while (increment(&count) == 0)
puts(count.s);
return 0;
}

BeanCounter.java

Who are you quoting, >>55-kun?

>>58
Some Canadian Amazon reviewer obviously.

>>55

even my intructor said this book is not book

Astrachan

JEW

https://books.google.com/books?id=_dQP4nHgyVUC&pg=PA386&dq=l&hl=en&sa=X&redir_esc=y#v=onepage&q=astrachan&f=false

(define (make-counter)
(let ((value 0))
(lambda ()
(set! value (+ value 1))
value)))

http://www.cs.duke.edu/csed/poop/huff/

Found more bullshit (I am not sure if the URL is meant to be satirical) from the same guy.

Huffman Coding, sounds like a good thing to have students play with. That I agree with. What's wrong? Everything else. Explicitly storing Huffman trees, actually using a tree for the algorithm, turning dozen-liners into multiclass ENTERPRISE monstrosities, and ignoring the simplicity and elegance of Canonical Huffman are things that no one actually does in the real world.

>>63

poop

Check em

>>65
You want me to check those? You better get ready to check my dubs.

>>63

/poop/huff

that was jenkem quality!