public void reverseList() { if (head == 0) return; if (head->next == 0) return; if (head->next == tail) { head->next = 0; tail->next = head; } else { node* pre = head; node* cur = head->next; node* curnext = cur->next; head->next = 0; cur->next = head; for (; curnext !=… Continue reading
Structure: Initially (in C) a structure was used to bundle different type of data types together to perform a particular functionality. But C++ extended the structure to contain functions also. The major difference is that all declarations inside a structure are by default public. Class: Class is a successor of… Continue reading
Array is collection of homogeneous elements. List is collection of heterogeneous elements. For Array memory allocated is static and continuous. For List memory allocated is dynamic and Random. Array: User need not have to keep in track of next memory allocation. List: User has to keep in Track of next… Continue reading
Runtime type identification (RTTI) lets you find the dynamic type of an object when you have only a pointer or a reference to the base type. RTTI is the official way in standard C++ to discover the type of an object and to convert the type of a pointer or… Continue reading
Array is fixed length and Array is a simple sequence of numbers which are not concerned about each-others positions but linked list is variable length In array values are accessing easy but linked list is some time taken process because search either forward or backward In array updating operations are… Continue reading
A hash table is a generic data structure providing for fast and random retrieval of objects. It is sometimes called a map or a dictionary (although the implementations may differ). Its a key-value pairs. The tenet of a hash table is that the location of an object in the data… Continue reading