Can you implement bucket sort algorithm in c++ for me and run a test program for it.

I need help being able to make a function that adds an item to the back of a doubly linked list to add an animal to the end of the list in C++ Here's what I got so far with the code #include <iostream> #include <string> using namespace std;   class node { public:     string data;// Data item     node* next; // Point to next node };   class linkedList { public:          // Variables? (Attributes)     node* headptr;          // Functions (methods)     linkedList()     {         headptr = nullptr;     }          // Add an item to front of list     void addFront(string x)     {         // Declare a pointer variable         node* p;                  // Create a new node, and store its address in p         p = new node;                  // Put x into data field of the new node         // Can also put p -> data = x, same thing.         (*p).data = x;                  // Set next pointer of node to previous front item         (*p).next = headptr;                  //Update the…

The code still does not seem to work for me. The error I get is: "Program stack overflow." I am using GNU Common Lisp Listener, perhaps this code can be tweaked again to ensure this error does not pop up again?

in a few sentences say: c++ uses Templates, but Java uses Generic classes which one is better or you will choose which one why?