Sha256: 5198f25e98fdab31c4b880570ef3e5b87112b2aaa1b77eeabbb5cbd8cc5c0dbb
Contents?: true
Size: 836 Bytes
Versions: 183
Compression:
Stored size: 836 Bytes
Contents
# Parallel Letter Frequency Count 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. ## Hints For this exercise the following F# feature comes in handy: - [Asynchronous programming](https://fsharpforfunandprofit.com/posts/concurrency-async-and-parallel/) .NET has asynchronous functionality built-in which enables you to run things in parallel (assuming you have a multi-core processor which is becoming more an more common) easily ## Submitting Incomplete Solutions It's possible to submit an incomplete solution so you can see how others have completed the exercise.
Version data entries
183 entries across 183 versions & 1 rubygems