Write a program that, given a text, determines and prints a histogram with the frequency of each letter of the alphabet. The frequency is the percentage of the number of appearances of each letter from the total count of letters. The program should count only the appearances of letters and ignore digits, signs, and other possible characters. The frequency must be determined based on the count of letters and not the text size.
49. Text histogram
by Marius Bancila, Richard Grimes
Modern C++: Efficient and Scalable Application Development
- Title Page
- Copyright
- About Packt
- Contributors
- Preface
- Understanding Language Features
- Working with Memory, Arrays, and Pointers
- Using Functions
- Classes
- Using the Standard Library Containers
- Using Strings
- Diagnostics and Debugging
- Learning Modern Core Language Features
- Using auto whenever possible
- Creating type aliases and alias templates
- Understanding uniform initialization
- Understanding the various forms of non-static member initialization
- Controlling and querying object alignment
- Using scoped enumerations
- Using override and final for virtual methods
- Using range-based for loops to iterate on a range
- Enabling range-based for loops for custom types
- Using explicit constructors and conversion operators to avoid implicit conversion
- Using unnamed namespaces instead of static globals
- Using inline namespaces for symbol versioning
- Using structured bindings to handle multi-return values
- Working with Numbers and Strings
- Converting between numeric and string types
- Limits and other properties of numeric types
- Generating pseudo-random numbers
- Initializing all bits of internal state of a pseudo-random number generator
- Creating cooked user-defined literals
- Creating raw user-defined literals
- Using raw string literals to avoid escaping characters
- Creating a library of string helpers
- Verifying the format of a string using regular expressions
- Parsing the content of a string using regular expressions
- Replacing the content of a string using regular expressions
- Using string_view instead of constant string references
- Exploring Functions
- Defaulted and deleted functions
- Using lambdas with standard algorithms
- Using generic lambdas
- Writing a recursive lambda
- Writing a function template with a variable number of arguments
- Using fold expressions to simplify variadic function templates
- Implementing higher-order functions map and fold
- Composing functions into a higher-order function
- Uniformly invoking anything callable
- Standard Library Containers, Algorithms, and Iterators
- Using vector as a default container
- Using bitset for fixed-size sequences of bits
- Using vector<bool> for variable-size sequences of bits
- Finding elements in a range
- Sorting a range
- Initializing a range
- Using set operations on a range
- Using iterators to insert new elements in a container
- Writing your own random access iterator
- Container access with non-member functions
- Math Problems
- Problems
- 1. Sum of naturals divisible by 3 and 5
- 2. Greatest common divisor
- 3. Least common multiple
- 4. Largest prime smaller than given number
- 5. Sexy prime pairs
- 6. Abundant numbers
- 7. Amicable numbers
- 8. Armstrong numbers
- 9. Prime factors of a number
- 10. Gray code
- 11. Converting numerical values to Roman
- 12. Largest Collatz sequence
- 13. Computing the value of Pi
- 14. Validating ISBNs
- Solutions
- 1. Sum of naturals divisible by 3 and 5
- 2. Greatest common divisor
- 3. Least common multiple
- 4. Largest prime smaller than given number
- 5. Sexy prime pairs
- 6. Abundant numbers
- 7. Amicable numbers
- 8. Armstrong numbers
- 9. Prime factors of a number
- 10. Gray code
- 11. Converting numerical values to Roman
- 12. Largest Collatz sequence
- 13. Computing the value of Pi
- 14. Validating ISBNs
- Problems
- Language Features
- Strings and Regular Expressions
- Problems
- 23. Binary to string conversion
- 24. String to binary conversion
- 25. Capitalizing an article title
- 26. Joining strings together separated by a delimiter
- 27. Splitting a string into tokens with a list of possible delimiters
- 28. Longest palindromic substring
- 29. License plate validation
- 30. Extracting URL parts
- 31. Transforming dates in strings
- Solutions
- 23. Binary to string conversion
- 24. String to binary conversion
- 25. Capitalizing an article title
- 26. Joining strings together separated by a delimiter
- 27. Splitting a string into tokens with a list of possible delimiters
- 28. Longest palindromic substring
- 29. License plate validation
- 30. Extracting URL parts
- 31. Transforming dates in strings
- Problems
- Streams and Filesystems
- Date and Time
- Algorithms and Data Structures
- Problems
- 45. Priority queue
- 46. Circular buffer
- 47. Double buffer
- 48. The most frequent element in a range
- 49. Text histogram
- 50. Filtering a list of phone numbers
- 51. Transforming a list of phone numbers
- 52. Generating all the permutations of a string
- 53. Average rating of movies
- 54. Pairwise algorithm
- 55. Zip algorithm
- 56. Select algorithm
- 57. Sort algorithm
- 58. The shortest path between nodes
- 59. The Weasel program
- 60. The Game of Life
- Solutions
- 45. Priority queue
- 46. Circular buffer
- 47. Double buffer
- 48. The most frequent element in a range
- 49. Text histogram
- 50. Filtering a list of phone numbers
- 51. Transforming a list of phone numbers
- 52. Generating all the permutations of a string
- 53. Average rating of movies
- 54. Pairwise algorithm
- 55. Zip algorithm
- 56. Select algorithm
- 57. Sort algorithm
- 58. The shortest path between nodes
- 59. The Weasel program
- 60. The Game of Life
- Problems
- Other Books You May Enjoy
49. Text histogram
-
No Comment
..................Content has been hidden....................
You can't read the all page of ebook, please click here login for view all page.