Well, I see a few problems. First, the loop starting at line 26 runs until ctr1 <= n-1. In your case n is 5, so the loop will run four iterations with ctr1 having the values 1, 2, 3, and 4. In the last iteration ctrl1 is 4, and you set ctr2 to ctr1 + 1, or 5. The valid indexes for Arr1 are 0 to 4, so you will be indexing outside the array. In
Java (for example) you'd get a thrown exception, but in C/C++ you just get the value of that memory location, even though it's outside the array. That's why 0 appears in your sorted list even though it's not one of the input values.
Second, there is a loop starting at line 41 that collects user input again. Fortunately that never runs because the counter ctrl1 is always equal to n when that loop starts. Still, it's useless and distracting.
You should remove that.
Finally, which sort algorithm are you trying to implement? It looks like it could be bubble sort, but some of the specifics don't look quite right.