Homework 5: "Pal fun nuf lap?"

Goals

• Built a program from multiple source files.
• Used an enumerated type.
• Implemented insertion sort.
• Continue to develop your skills with arrays.
• Continue to develop skills in program specification and planning.

Special Note

Furthermore, we will continue to develop skills related to specification and design, portions of which will be provided. Your implementation must match the provided specification.

The Formal Description section is NOT the actual assignment. The actual assignment will be provided in the Actual Description section of this document.

Formal Description

• The first should solve Assignment 2, Notlob?.
• Program 2

  Write a program which prompts the user for a file containing a list of phrases, one per line. The program should read the phrases and print a list of the perfect palindromes, a list of natural palindromes, a list of regular palindromes and a list of non-palindromes. The lists should be sorted alphabetically. The program should be able to store 1,000 palindromes.

  Please label each list as follows:

  The XXXXs in the list are:
  

  where XXXX is the name of the palindrome class. Furthermore, please print a blank line after printing each list.

  Please place each palindrome on a line, enclosed in quotation marks. Please place a tab before the palindromes.

  Example input:

  racecar
  god saw I was dog
  I did, did I?
  Able was I ere I saw Elba.
  A man, A plan, A canal: Panama!
  Madam, I'm Adam.
  Hello World!
  spam
  

  Your program should produce the following output

  Enter a file name =>example.in
  
  The perfect palindromes in the list are:
  	"god saw I was dog"
  	"racecar"
  
  The natural palindromes in the list are:
  	"Able was I ere I saw Elba."
  	"I did, did I?"
  
  The palindromes in the list are:
  	"A man, A plan, A canal: Panama!"
  	"Madam, I'm Adam."
  
  The non-palindromes in the list are:
  	"Hello World!"
  	"spam"
  
  

Actual Description

Palindrome Utility Library, PalRoutines

• PalRoutines.h
• PalRoutines.C

Program 1

Please name the source code file for this palindrome.C/cpp

Program 2

Please name the source code file for this palSorter.C/cpp

Discussion

• I will not check spacing on the prompt.
• I will deduct points for all other formatting issues.
• Please print a newline after the user enters the file name.
• There is no reason to rename PalRoutines.C or PalRoutines.h
• You should NOT include PalRoutines.C
• You should include PalRoutines.h
• You should not perform any computations done by PalRoutines functions directly, call these functions.
• If you name your files as requested, the supplied Makefile will compile your code.
• You must implement insertion sort for this project. I am sure you can find on line c++ code o do this, but using this, in my opinion
  • Would be a violation of the honor code.
  • Would be cheating.
  • Would be dumb, you need to implement this to hone your array manipulation skills.
  • The algorithm for insertion sort

    • InsertionSort(item A[], size_t size)
       
          size_t i,j
          i = 1
          while i < size
             j = i
             while j > 0 and A[j-1] > A[j]
                swap(A[j],A[j-1])
       	 j--
             i++
      
      

    • Lines 1 and 2 identify the next item to put in order
    • Lines 3-7 move that item to the proper location.
  • Insertion sort
    • Spends far more time moving data around.
    • But two data items of the same value maintain their relative order. (It is a stable sort)
    • The sort is really good if the array is mostly in order.
    • Or if you are maintaining order in a changing array.
• You MUST put your insertion sort in a different file so that you can use it again if you wish. (sort.h and sort.C/cpp).

Required Files

Submission