exam final

1 files changed, 40 insertions, 0 deletions

diff --git a/exam_final/subjects/11-0-ord_alphlong/subject.en.txt b/exam_final/subjects/11-0-ord_alphlong/subject.en.txt
new file mode 100644
index 0000000..118a1ca
--- /dev/null
+++ b/exam_final/subjects/11-0-ord_alphlong/subject.en.txt
@@ -0,0 +1,40 @@
+Assignment name  : ord_alphlong
+Expected files   : *.c, *.h
+Allowed functions: write, malloc, free
+--------------------------------------------------------------------------------
+
+Write a program that takes a string as a parameter and prints its words sorted
+in length order then in alphabetical order: when words are alphabetically
+equals (for example aA and Aa), original order must remain (lower and upper
+case are the same in alphabetical order). If there are duplicates, they must
+remain.
+
+If number of parameters is different from 1, the program prints 
+\n.
+
+There will be only spaces, tabs and alphanumeric caracters in strings.
+
+You'll print only one space between each word. Nothing before the first and 
+after the last word of each line.
+
+Examples:
+
+$>./ord_alphlong
+$
+$>./ord_alphlong "After all this time Always said Snape" | cat -e
+all$
+said this time$
+After Snape$
+Always$
+$>./ord_alphlong "A a b B cc ca cd" | cat -e
+A a b B$
+ca cc cd$
+$>./ord_alphlong "Never take a gamble you are not prepared to lose" | cat -e
+a$
+to$
+are not you$
+lose take$
+Never$
+gamble$
+prepared$
+$>