Chapter 7, Problem 13E

Program Plan Intro

Program Plan:

• Include required header files
• Definition for the function “sort()”.
  • Declare the variables.
  • Condition to check the “i<n-1”.
    • Condition to check the “j<n”.
      • Check whether to sort in increasing order.
        • Assign “a[i] ” to “temp”.
        • Assign “a[j] ” to “a[i]”.
        • Assign “a[j]” to “temp”.
      • Check whether to sort in decreasing order.
        • Assign “a[i]” to “temp”.
        • Assign “a[j] ” to “a[i]”.
        • Assign “a[j]” to “temp”
• Define the main function
  • Declare the required variable
  • Initialize the array.
  • Print the statement.
  • Loop to traverse the array.
    • Print the element.
  • Call the function “sort()”.
  • Loop to traverse the array.
    • Print the element.
    • Print new line
    • Return the value “0”.