https://www.dropbox.com/s/95w9wqkova5i8zy/New%20folder.zip?dl=0 those are the fo

Question

https://www.dropbox.com/s/95w9wqkova5i8zy/New%20folder.zip?dl=0

those are the folder files, I am bit still behind on Bootstrap.

of these SDS for t date. Diss payablo be IO With Its Positions abso, Width ean ute Positions abs a te Wich1 se FIGURE S.39 Completed project 2 PROJECT 3 Art Store DIFFICULTY LEVE Advanced Over in Use the Bootstrap Css framework (included and available from the web) as well modify chapteros-projecto3.css and chapteros-projecto3.html so it looks similar to that shown in Figure S-40 Instructions 1. Examine chapteros-projecto3.html in the browser. You will need to add a fair bit of HITML in accordance with the Bootstrap documentation. since you can use the various Bootstrap classes, you will need to write very little CSS (the solution shown in Figure S40 has fewer than ten rules defined ) 2. The first step will be defining the basic structure. Figure S 40 shows that most of the content is contained within a main row ie., below the navbars and above the footer) that is composed of two columns (one 10 wide, the other 2 wide). The Bootstrap grid classes ( eg., co, -md -ho) are shown at the top of the figure. ne of the columns has a nested row within it that contains the painting inmage and the data on the painting .

Explanation / Answer

Here is your C++ program -

#include<iostream>
#include<bits/stdc++.h>
using namespace std;

struct Node
{
int value;
struct Node *next;
};

// function to create a new Node
struct Node *newNode(int value)
{
Node *temp = new Node;
temp->value = value;
temp->next = NULL;
return temp;
}

/* Function to remove duplicates from a
unsorted linked list */
void removeDuplicates(struct Node *start)
{
struct Node *ptr1, *ptr2, *dup;
ptr1 = start;

/* Pick elements one by one */
while (ptr1 != NULL && ptr1->next != NULL)
{
ptr2 = ptr1;

/* Compare the picked element with rest
of the elements */
while (ptr2->next != NULL)
{
/* If duplicate then delete it */
if (ptr1->value == ptr2->next->value)
{
/* sequence of steps is important here */
dup = ptr2->next;
ptr2->next = ptr2->next->next;
delete(dup);
}
else /* This is tricky */
ptr2 = ptr2->next;
}
ptr1 = ptr1->next;
}
}

//to print the nodes
void printList(struct Node *node)
{
while (node != NULL)
{
printf("%d ", node->value);
node = node->next;
}
}

//main function
int main()
{

/*linked list is 10->12->11->11->12->11->10*/
struct Node *start = newNode(10);
start->next = newNode(12);
start->next->next = newNode(11);
start->next->next->next = newNode(11);
start->next->next->next->next = newNode(12);
start->next->next->next->next->next =
newNode(11);
start->next->next->next->next->next->next =
newNode(10);

printf(" Status of the Linked list before removing duplicates ");
printList(start);

removeDuplicates(start);

printf(" Status of the Linked list after removing duplicates ");
printList(start);

return 0;
}

Related Questions

Navigate

• Browse (All)
• Browse H
• Subjects

---

---

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