Encerrado

short program

[url removed, login to view] the user for a random seed for the random number generator (see below for background). [url removed, login to view] two lists of twenty random numbers within the range 0 .. 99. [url removed, login to view] lists MUST be in order. [url removed, login to view] each list on a single line of output. [url removed, login to view] the Union List. [url removed, login to view] the Union List. [url removed, login to view] the Intersection List [url removed, login to view] the Intersection List [url removed, login to view] a new (third) list of 20 random integers in the range 0 .. 9. [url removed, login to view] list should be constructed by attached values at the head of the list; thus, it will most likely not be in order. [url removed, login to view] the third list. [url removed, login to view] all the duplicate values from the third list. [url removed, login to view] the third list. [url removed, login to view] all the odd values from the third list. [url removed, login to view] the third list. Note- Program must use points and nodes just to name a few.

## Deliverables

1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request. 3) Complete ownership and distribution copyrights to all work purchased. To start off with a random seed to the random number generator "rand()" us something like unsigned seed; cout << "Random Seed? "; cin >> seed; srand(seed); The function rand() produces a random integer between 0 and a number called RAND_MAX. If, for example, you wish to produce only numbers between 0 and 499, you'll need to get the values from "rand() % 500". The basic node structure in the notes should be good for your linked lists: struct node { int data; node * next; node ( int dat, node * nex ) : data (dat), next(nex) {} }; The Union and Intersection functions should use InsertInOrder(?.) and bool Find(?.). void InsertInOrder ( node * & head, DataType item ) { node * previous = NULL, *current = head; for ( ; current != NULL && current->data < item; previous = current, current = current->next ); if ( previous == NULL ) //insert at head head = new node ( item, head ); else previous->next = new node ( item, current ); bool Find ( node * head, DataType item ) { node * temp = head; for ( ; temp != NULL && temp->data != item; temp = temp->next); return ( temp != NULL ); } The functions that remove all duplicates from the third list and then remove all odd values should use of the bool Find(?) function might help.

## Platform

DOS/Windows

Habilidades: Programação C, Engenharia, MySQL, PHP, Arquitetura de software, Teste de Software

Veja mais: use of data structure in programming, unsigned integer, union find data structure, union find, union data structure, union c programming, struct c programming, rand c programming, programming head, program find, php programming notes, on the intersection, notes php programming, node programming, node data structure, lists data structure, linked list in data structure, linked list data structure, linked int, line to line intersection, line of intersection, line line intersection, line intersection c, intersection points, intersection of two line

Acerca do Empregador:
( 46 comentários ) United States

ID do Projeto: #2910803

16 freelancers estão ofertando em média $7 para esse trabalho

ingeniadesign

See private message.

$8.5 USD in 14 dias
(53 Comentários)
5.1
sarderhasnut

See private message.

$8.5 USD in 14 dias
(54 Comentários)
4.8
vw450309vw

See private message.

$8.5 USD in 14 dias
(17 Comentários)
3.8
javoreu

See private message.

$6.8 USD in 14 dias
(39 Comentários)
3.7
vladfein

See private message.

$8.5 USD in 14 dias
(8 Comentários)
3.6
bogralteam

See private message.

$8.5 USD in 14 dias
(6 Comentários)
3.5
stefanc

See private message.

$6.8 USD in 14 dias
(17 Comentários)
3.0
cgtvw

See private message.

$8.5 USD in 14 dias
(5 Comentários)
2.7
navenduvw

See private message.

$4.25 USD in 14 dias
(24 Comentários)
2.8
dannynoest

See private message.

$6.8 USD in 14 dias
(15 Comentários)
2.7
vw724304vw

See private message.

$8.5 USD in 14 dias
(4 Comentários)
2.4
bmcnett

See private message.

$8.5 USD in 14 dias
(3 Comentários)
1.9
abhijitsathe

See private message.

$8.5 USD in 14 dias
(6 Comentários)
1.7
skavw

See private message.

$4.25 USD in 14 dias
(1 Comentário)
0.0
spacvw

See private message.

$4.25 USD in 14 dias
(0 Comentários)
0.0
mustafakurul

See private message.

$4.25 USD in 14 dias
(0 Comentários)
0.0
a2zsolutionsvw

See private message.

$7.65 USD in 14 dias
(0 Comentários)
0.0