The reason your program fails to reverse a list is because when the user chooses menu option 9, all they get is a print statement declaring the code isn’t working yet. At a high level, reversing a linked list can be accomplished like this: for each element in the input list, from beginning to end: … Read more
I’ve debugged this for you. Fixes: In list_insertn, replace the entire if statement after the “If we exceed list length append at the end” comment with: if(list == NULL){ return list_insert_tail(list, input); } In list_remove, replace the test after the “We check to see if they have the same data” comment with: if(strcmp(list->data, input) == … Read more
Look at this code: if (a == b) { while (a == b) { ptr->next = tmp->next; tmp = tmp->next; } When a is equal to b you execute the while (a == b). Since you don’t change a or b in the body of the while, you have an endless loop. Sooner or later … Read more
Your linked list declaration is wrong. You don’t use [] when creating a new object in java. Instead you use (). And your generic type is also wrong -> if you want to have more linked lists inside the main linked list. Try this LinkedList<LinkedList> LK = new LinkedList<>(); Note – The part inside <> … Read more
Your question isn’t clear, but I suspect the main point you may be missing is that ListIterator.add inserts at the current location: The element is inserted immediately before the next element that would be returned by next(), if any, and after the next element that would be returned by previous(), if any. And also: The … Read more
You are not changing pointer for head for initial case and head is always null. if(cur==null){ cur = nn; } should be if(head==null){ head = nn; }
Simplest will be bubble sort. item* sort(item *start){ item *node1,*node2; int temp; for(node1 = start; node1!=NULL;node1=node1->next){ for(node2 = start; node2!=NULL;node2=node2->next){ if(node2->draw_number > node1->draw_number){ temp = node1->draw_number; node1->draw_number = node2->draw_number; node2->draw_number = temp; } } } return start; }
You can make a wrapper class for the data structure such as public class DateWrapper{ private int a; private int b; private int c; private Date date; public DateWrapper(int a, int b, int c, Date date){ this.a = a; this.b = b; this.a = c; this.date = date; } // getters and setters } and … Read more
You can take a reasonable guess as to what these functions could do from just the declarations. bool (List, int) Takes a list and an element and returns a true/false answer. An immediate guess is “does this list contain this element”. We then look at the definition (*), see that the null list is false, … Read more
That’s why there are debug tools like gdb (just google for it 😉 ). This is the backtrace: #0 0x00000000004009ba in node::setnext (this=0x0, x=0x614cc0) at a.cpp:25 #1 0x0000000000400c18 in list::insertend (this=0x7fffffffdf10, x=45) at a.cpp:109 #2 0x00000000004008df in main () at a.cpp:137 that means in line 137 there is a function call (l.insertend(45)), then in line … Read more