Bubble sort - linked list program Solution // preprocessor directives # include

Question

Bubble sort - linked list program

Explanation / Answer

// preprocessor directives # include # include using namespace std; // class nodeType class nodeType { // class members public: char fName[ 15 ]; char lName[ 15 ]; nodeType *next; }; // main int main() { // declare pointers of type nodeType nodeType *head, *first, *newNode, *last, *temp1, *temp2; // set pointers to 0 head = NULL; first = NULL; newNode = NULL; last = NULL; temp1 = NULL; temp2 = NULL; char fn[ 15 ]; int numberOfNodes = 0; //============Input Names=========================== cout > fn; // loop for 3 times for ( int a = 0; a < 3; a++ ) { // create new node newNode = new nodeType; // store first name in node for ( int i = 0; i < 15; i++ ) newNode -> fName[ i ] = fn[ i ]; // count number of nodes in list numberOfNodes++; // input last name cout > newNode -> lName; // set end of node to 0 newNode -> next = NULL; // if node is empty set pointers to 0 if ( first == NULL ) { head = newNode; first = newNode; last = newNode; } else { last -> next = newNode; last = newNode; } cout > fn; } // end while //=================Print unsorted list======================== cout

Related Questions

Navigate

• Browse (All)
• Browse B
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.