Form a model of sorted list using: a) array representation; b) single-linked lis

Question

Form a model of sorted list using:
a) array representation;
b) single-linked list with pointer tail to the last element;
c) single-linked list without pointer tail to the last element;
d) developing single-linked circular list;
e) double-linked list with pointer tail to the last element;
f) double-linked list without pointer tail to the last element;
g) developing double-linked circular list,
make a description of it and develope sorted list processing operations:
a) FindKey, Delete (previous element becomes a new current element), Terminate;
b) Update, Findith, Delete (next element becomes a new current element);
c) Insert, FindKey, FindFirst,.
d) Findith, Update, FindPrior, FindLast

Explanation / Answer

// using two-dimensional array to compute the // average of all the elements in array named x #include using namespace std; #define m 4 #define n 5 int main() { int i, j, total = 0; // a 4x5 or [4][5] array variable... int q[m][n]={{4,5,6,2,12},{10,25,33,22,11}, {21,32,43,54,65},{3,2,1,5,6}}; float average; // the outer for loop, read row by row... for(i=0; i

Related Questions

Navigate

• Browse (All)
• Browse F
• Subjects

---