Write a C plus plus program to move a node to nth position in forward?

Answer 1

#include<iostream>

#include<forward_list>

void print (std::forward_list<unsigned>& list)

{

for (std::forward_list<unsigned>::iterator i=list.begin(); i!=list.end(); ++i)

std::cout << *i << '\t';

std::cout << std::endl;

}

bool insert (std::forward_list<unsigned>& list, unsigned value, unsigned position)

{

// there is no 0th position

if (position list.end())

return false;

// i is the nth-1 node

list.insert_after (i, value);

return true;

}

bool move (std::forward_list<unsigned>& list, unsigned value, unsigned position)

{

list.remove (value);

return (insert (list, value, position));

}

int main()

{

// initialise a forward list with 9 unique values 1, 2, 3, ..., 8, 9

std::forward_list<unsigned> list;

for (unsigned i=1; i<=10; ++i)

insert (list, i, i);

std::cout << "initial list\n" << std::endl;

print (list );

// insert the value 11 at the 6th position in the list

insert (list, 11 , 6);

std::cout << "\nafter inserting the value 11 at position 6\n" << std::endl;

print (list);

// move the value 11 to position 11 in the list

move (list, 11, 11);

std::cout << "\nafter moving the value 11 to position 11\n" << std::endl;

print (list);

}