The document describes an assignment to read in an unspecified number (n) of names of up to 20 characters each, sort the names alphabetically, and print the sorted list. It provides examples of reading in 3 names ("Arunachal", "Bengaluru", "Agra"), sorting them using a custom string comparison function, and printing the sorted list ("Agra", "Arunachal", "Bengaluru"). Pre-requisites for the assignment include functions, dynamic arrays, and pointers. The objective is to understand how to use functions, arrays and pointers to complete the task.

1. Team Emertxe
Advanced Pointers,Arrays and
Functions

2. Assignment 6

3. Assignment 6

4. Assignment 6
Read n & n person names of maxlen 20. Sort and print the
names

5. Assignment 6
Read n & n person names of maxlen 20. Sort and print the
names
Input:

6. Assignment 6
Read n & n person names of maxlen 20. Sort and print the
names
Input: Read n value and n person names

7. Assignment 6
Read n & n person names of maxlen 20. Sort and print the
names
Input: Read n value and n person names
Output:

8. Assignment 6
Read n & n person names of maxlen 20. Sort and print the
names
Input: Read n value and n person names
Output: Sort the names and print

9. Examples:-
Assignment 6

10. Examples:-
 Read the rows/names(N). Assume N = 3
 Rows are dynamic.
 Columns/Characters are static to 20.
Assignment 6

11. Examples:-
 Read the rows/names(N). Assume N = 3
 Rows are dynamic.
 Columns/Characters are static to 20.
Assignment 6
1000
2000
3000
500
504
508
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

12. Examples:-
 Read the 3 names.
 [0] -> Arunachal
 [1] -> Bengaluru
 [2] -> Agra
Assignment 6

13. Examples:-
Assignment 6
1000
2000
3000
500
504
508
A r u n a c h a l 0
B e n g a l u r u 0
A g r a 0
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

14. Examples:-
 Compare each characters starting from the 1st row.
 Compare using strcmp function(Don’t use built in)
 In strcmp function,
• If 1st character of string 1 == 1st character of string 2,
-> Move to the next character.
• If 1st character of string 1 > 1st character of string 2,
-> Swap the strings.
• If 1st character of string 1 < 1st character of string 2,
-> Don’t swap.
Assignment 6

15. Examples:-
 Comparing ‘A’ from Arunachal and ‘B’ from Bengaluru
 ‘A’ < ‘B’, so don’t swap.
Assignment 6
1000
2000
3000
500
504
508
A r u n a c h a l 0
B e n g a l u r u 0
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19
A g r a 0

16. Examples:-
 Comparing ‘B’ from Bengaluru and ‘A’ from Agra.
 ‘B’ > ‘A’, so swap the strings.
Assignment 6
1000
2000
3000
500
504
508
A r u n a c h a l 0
B e n g a l u r u 0
A g r a 0
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

17. Examples:-
 Comparing ‘B’ from Bengaluru and ‘A’ from Agra.
 ‘B’ > ‘A’, so swap the strings.
Assignment 6
1000
3000
2000
500
504
508
A r u n a c h a l 0
A g r a 0
B e n g a l u r u 0
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

18. Examples:-
 Comparing ‘B’ from Bengaluru and ‘A’ from Agra.
 ‘B’ > ‘A’, so swap the strings.
Assignment 6
1000
3000
2000
500
504
508
A r u n a c h a l 0
A g r a 0
B e n g a l u r u 0
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

19. Examples:-
 Comparing ‘A’ from Arunachal and ‘A’ from Agra.
 ‘A’ = ‘A’, so compare the next character.
Assignment 6
1000
3000
2000
500
504
508
A r u n a c h a l 0
A g r a 0
B e n g a l u r u 0
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

20. Examples:-
 Comparing ‘r’ from Arunachal and ‘g’ from Agra.
 ‘r’ > ‘g’, so swap the strings.
Assignment 6
1000
3000
2000
500
504
508
A r u n a c h a l 0
A g r a 0
B e n g a l u r u 0
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

21. Examples:-
 Comparing ‘r’ from Arunachal and ‘g’ from Agra.
 ‘r’ > ‘g’, so swap the strings.
Assignment 6
3000
1000
2000
500
504
508
A g r a 0
A r u n a c h a l 0
B e n g a l u r u 0
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

22. Examples:-
 Comparing ‘A’ from Arunachal and ‘B’ from Bengaluru.
 ‘A’ < ‘B’, so don’t swap.
Assignment 6
3000
1000
2000
500
504
508
A g r a 0
A r u n a c h a l 0
B e n g a l u r u 0
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

23. Examples:-
 This is the sorted order of names.
Assignment 6
3000
1000
2000
500
504
508
A g r a 0
A r u n a c h a l 0
B e n g a l u r u 0
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

24. Sample execution:-
Assignment 6

25. Sample execution:-
Assignment 6

26. Assignment 6
Pre-requisites:-

27. Assignment 6
Pre-requisites:-
⮚ Functions

28. Assignment 6
Pre-requisites:-
⮚ Functions
⮚ Dynamic Arrays

29. Assignment 6
Pre-requisites:-
⮚ Functions
⮚ Dynamic Arrays
⮚ Pointers

30. Assignment 6
Pre-requisites:-
⮚ Functions
⮚ Dynamic Arrays
⮚ Pointers
Objective:-

31. Assignment 6
Pre-requisites:-
⮚ Functions
⮚ Dynamic Arrays
⮚ Pointers
Objective:-
⮚ To understand the concept of Functions ,Arrays and Pointers

32. Team Emertxe
Thank you