====== HW 03 - Strings ======
The task is to write a simple program that reads a long multiword string with a predefined length. You should parse the string into a **new** array where the elements are the individual words. The space character is considered the delimiter. Then, use the //[[https://en.cppreference.com/w/c/algorithm/qsort|qsort()]]// function from stdlib.h library to lexicographically sort the words in ascending order. The program also counts how many times each word appears in the text. The program prints the sorted words and their occurrence on a separate line and terminates cleanly. Uppercase letters should be ordered before lowercase letters.

Each line on the output should contain a number of occurrences and the appropriate word in the order separated by a single space.

You will get the standard input of your program as follows
<code>
<number of characters>
<multiword string>
</code>

There will definitely be only a single space character between individual words.

There will be at least one word on the input.

Each word has at least one letter.

Your program is expected to allocate and deallocate used memory properly using //malloc()//, //realloc()//, //free()//. You should not use a preallocated stack memory.

<note tip>
For sorting the array of words, use the function from stdlib.h
<code>
void qsort( void *ptr, size_t count, size_t size,
            int (*comp)(const void *, const void *) );
</code>
</note>
<note tip>
You can use [[https://en.cppreference.com/w/c/string/byte|string.h]] library for string operations.
</note>

You can find testing instances {{ :courses:be5b99cpl:hw:hw3_public_v2.zip |here}}. Files with the suffix ''.in'' contain your input with ''.out'' your desired output.

<note tip>
When you have a file ''pub00.in'' containing the program input, you can pass it to your program in like
<code>
$ cat pub00.in | ./main
</code></note>
===== Examples =====
^ Standard input ^ Expected output ^
| <code>
25
a bird came down the walk
</code> | <code>
1 a
1 bird
1 came
1 down
1 the
1 walk
</code> |
| <code>
56
word the be there will be at least one word On the Input
</code> | <code>
1 Input
1 On
1 at
2 be
1 least
1 one
2 the
1 there
1 will
2 word
</code> |

===== Evaluation =====
<note>
Upload your solution into [[https://cw.felk.cvut.cz/brute/|BRUTE]] as a zip archive containing only your program's source files and either a Makefile or readme explaining how to compile it
</note>
<note important>Your submission must compile without errors with the following compiler flags

''-Wall -Werror -pedantic -std=c99 -O2''</note>

The maximum number of points is 10. No automatic evaluation, as you can test and verify your solution using the provided instances or generate your own.
  * 2 points - parsing of a string into an array of words
  * 3 points - words are sorted in ascending order
  * 2 points - only unique works are printed in ascending order with their occurrences
  * 2 points - correct memory (de)allocation
  * 1 point - coding style (structured, commented, separated into functions …)
==== Bonus ====
  * 3 points - modify your program so that it does not need to know the input size before reading the text input.
    * The input then should be expected to look like this
      <code>
      <multiword string>
      </code>
    * The submitted source file names should end with ''_bonus'' suffix e.g. ''main_bonus.c'' etc