This document provides an assignment to print the values of an array in sorted order without modifying or copying the array. It includes an example of taking an input array, identifying the largest and smallest values, and iteratively comparing all other values to those to print the values in sorted order. Pre-requisites mentioned are arrays, functions, pointers, and nested loops. The objective is to understand arrays, functions, and pointers.

1. Team Emertxe
Function and Pointer
Basics

2. Assignment 19

3. Assignment 19

4. Assignment 19
Print the values in sorted order without modifying or
copying an array.

5. Assignment 19
Print the values in sorted order without modifying or
copying an array.
Input:

6. Assignment 19
Print the values in sorted order without modifying or
copying an array.
Input: Read integer ‘size’ and an array ‘arr[size]’

7. Assignment 19
Print the values in sorted order without modifying or
copying an array.
Input: Read integer ‘size’ and an array ‘arr[size]’
Output:

8. Assignment 19
Print the values in sorted order without modifying or
copying an array.
Input: Read integer ‘size’ and an array ‘arr[size]’
Output: Print the values in sorted order.

9. Assignment 19
Example’s:

10. Assignment 19
Example’s:
⮚Input: size = 5, arr[5] = {10, 3, 1, 8, -1}

11. Assignment 19
Example’s:
⮚Input: size = 5, arr[5] = {10, 3, 1, 8, -1}
Output:

12. Assignment 19
Example’s:
⮚Input: size = 5, arr[5] = {10, 3, 1, 8, -1}
Output: After sorting: -1, 1, 3, 8, 10

13. Assignment 19
Example’s:
⮚Input: arr[5] = {10, 3, 1, 8, -1}
arr 10 3 1 8 -1
0 1 2 3 4
index

14. Assignment 19
Example’s:
⮚Assign large and small to arr[0].
arr 10 3 1 8 -1
large & small
0 1 2 3 4
index

15. Assignment 19
Example’s:
⮚Find out smallest and largest on arr.
arr 10 3 1 8 -1
large small
0 1 2 3 4
index

16. Assignment 19
Example’s:
⮚Assign sec_small = large.
arr 10 3 1 8 -1
large and sec_small small
0 1 2 3 4
index

17. Assignment 19
Example’s:
⮚Print the values using ‘small’ value in each iteration and
compare all the elements with ‘small’ and ‘sec_small’.
arr 10 3 1 8 -1
small
large and sec_small
O/p:
-1
0 1 2 3 4
index

18. Assignment 19
Example’s:
⮚Check arr[0] > small & arr[0] < sec_small, false.
arr 10 3 1 8 -1
small
large and sec_small
0 1 2 3 4
index

19. Assignment 19
Example’s:
⮚Check arr[1] > small & arr[1] < sec_small, true. So assign
sec_small = arr[1].
arr 10 3 1 8 -1
small
sec_small
large
0 1 2 3 4
index

20. Assignment 19
Example’s:
⮚Check arr[2] > small & arr[2] < sec_small, true. So assign
sec_small = arr[2].
arr 10 3 1 8 -1
small
sec_small
large
0 1 2 3 4
index

21. Assignment 19
Example’s:
⮚Check arr[3] > small & arr[3] < sec_small, false.
arr 10 3 1 8 -1
small
sec_small
large
0 1 2 3 4
index

22. Assignment 19
Example’s:
⮚Check arr[4] > small & arr[4] < sec_small, false.
arr 10 3 1 8 -1
small
sec_small
large
0 1 2 3 4
index

23. Assignment 19
Example’s:
⮚After all the elements are compared, assign small = sec_small
and sec_small = large and print the small.
arr 10 3 1 8 -1
small
large & sec_small
O/p:
-1
1
0 1 2 3 4
index

24. Assignment 19
Example’s:
⮚Continue this process to get the sorted order.
arr 10 3 1 8 -1
small
large & sec_small
0 1 2 3 4
index

25. Assignment 19
Example’s:
arr 10 3 1 8 -1
small
large sec_small
0 1 2 3 4
index

26. Assignment 19
Example’s:
arr 10 3 1 8 -1
large & sec_small small
O/p:
-1
1
3
0 1 2 3 4
index

27. Assignment 19
Example’s:
arr 10 3 1 8 -1
large small sec_small
0 1 2 3 4
index

28. Assignment 19
Example’s:
arr 10 3 1 8 -1
large & sec_small small
O/p:
-1
1
3
8
0 1 2 3 4
index

29. Assignment 19
Example’s:
arr 10 3 1 8 -1
large, sec_small & small
O/p:
-1
1
3
8
10
0 1 2 3 4
index

30. Assignment 19
Sample execution:-

31. Assignment 19
Sample execution:-

32. Assignment 19
Sample execution:-

33. Assignment 19
Sample execution:-

34. Assignment 19
Pre-requisites:-

35. Assignment 19
Pre-requisites:-
⮚Arrays

36. Assignment 19
Pre-requisites:-
⮚Arrays
⮚Functions

37. Assignment 19
Pre-requisites:-
⮚Arrays
⮚Functions
⮚Pointers

38. Assignment 19
Pre-requisites:-
⮚Arrays
⮚Functions
⮚Pointers
⮚Nested loops

39. Assignment 19
Pre-requisites:-
⮚Arrays
⮚Functions
⮚Pointers
⮚Nested loops
Objective:-

40. Assignment 19
Pre-requisites:-
⮚Arrays
⮚Functions
⮚Pointers
⮚Nested loops
Objective:-
To understand the concept of
➢ Arrays

41. Assignment 19
Pre-requisites:-
⮚Arrays
⮚Functions
⮚Pointers
⮚Nested loops
Objective:-
To understand the concept of
➢ Arrays
➢ Functions

42. Assignment 19
Pre-requisites:-
⮚Arrays
⮚Functions
⮚Pointers
⮚Nested loops
Objective:-
To understand the concept of
➢ Arrays
➢ Functions
➢ Pointers

43. Team Emertxe
Thank you