summaryrefslogtreecommitdiff
path: root/go/parallel-letter-frequency/README.md
diff options
context:
space:
mode:
authorDimitri Sokolyuk <demon@dim13.org>2016-08-26 13:10:33 +0200
committerDimitri Sokolyuk <demon@dim13.org>2016-08-26 13:10:33 +0200
commit754e21075a2b67ab6df1b2aa6201d2506f07cd42 (patch)
tree3f6afadfa75c17846ee562aac7efbee70232f4a0 /go/parallel-letter-frequency/README.md
parentb436ce6e3473ea606259730a1e7c3fe6f72c990e (diff)
Add parallel letter
Diffstat (limited to 'go/parallel-letter-frequency/README.md')
-rw-r--r--go/parallel-letter-frequency/README.md24
1 files changed, 24 insertions, 0 deletions
diff --git a/go/parallel-letter-frequency/README.md b/go/parallel-letter-frequency/README.md
new file mode 100644
index 0000000..a2ed1ef
--- /dev/null
+++ b/go/parallel-letter-frequency/README.md
@@ -0,0 +1,24 @@
+# Parallel Letter Frequency
+
+Write a program that counts the frequency of letters in texts using parallel computation.
+
+Parallelism is about doing things in parallel that can also be done
+sequentially. A common example is counting the frequency of letters.
+Create a function that returns the total frequency of each letter in a
+list of texts and that employs parallelism.
+
+To run the tests simply run the command `go test` in the exercise directory.
+
+If the test suite contains benchmarks, you can run these with the `-bench`
+flag:
+
+ go test -bench .
+
+For more detailed info about the Go track see the [help
+page](http://exercism.io/languages/go).
+
+
+
+## Submitting Incomplete Problems
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.
+