Myönnetty

Given: Two lists of integers L1 and L2; Output: The largest number that occurs in L1 but does not occur in L2, or "None" if there is no such number.

Given: Two lists of integers L1 and L2;

Output: The largest number that occurs in L1 but does not occur in L2, or "None" if there is no such number.

Details

To keep input and output simple, a pair of lists will be in the form of a single text file, which you will read from standard input, as in Assignment 1. In the file, each list consists of a sequence of positive integers, one integer per line, with a line containing 0 delimiting the two lists. Here is an example: "sample1" file, for which the correct answer is 5. You can use this "[url removed, login to view]" file, which reads these files, as starter code.

The program should output two lines. The first line should contain your student number, login id, and name (in that order, separated by spaces). The second line should contain the answer, and only the answer. (Not something like "The answer is ...", for example).

You can use any algorithm you think up or find. However, you may use only data structures and ADTs which we have studied in the class. You may not read the size of the data file, so you must use at least one dynamic data structure.

For data structures and ADTs, you may use your own implementation or some other publicly available implementation. You must explicitly state, in comments in your source code, the source of any code you use which was not written entirely by you. You may also use C++ STL classes which implement ADTs we have studied in class.

You may not use a bit-vector set reprsentation, or any similar representation (i.e., where you record information about the integer i in a cell A[i] of an array, vector or similar).

Loading the lists into big arrays and sorting these is not an acceptable solution.

Your solution must be written in C++, include an appropriate makefile, and compile and run correctly on the CSIL Linux workstations.

Submit your solution on line as usual. Your submission should be a zip file of a the contents of a single folder, containing all your source code, any other files needed to compile your program. Running "make all" in the folder should generate an executable called "a4" which is your complied solution. The folder must contain a text filed called "[url removed, login to view]". It should contain a short description of your method, and clear information about any libraries, downloaded code, etc. which you have used (any code that contributes to your solution but which was not written by you, and not used previously in the course). For most students, this should be very short. Your main function should be in a filed called "[url removed, login to view]".

Both your [url removed, login to view] file and your [url removed, login to view] file must begin with a line or comment line containing your student number, login id, and name.

If you use code which is not your own, and not part of the STL, then:

It must be from a site which is (intentionally) public;

I should be able to get it myself, from your reference;

It must not have been produced by a student in this or any similar course, by someone helping such students, by someone hired for the purpose, etc. If in doubt, ask.

Your solution must be correct. In the spirit of the course, you should also aim for a solution that is efficient in terms of both computational time and memory consumed, and fast in practice. There is no specific requirement regarding time or space complexity or actual speed, but your solution should also not be unreasonably inefficient. If in doubt, ask.

This is a c++ program

Taidot: C++ -ohjelmointi

Näytä lisää: vector stl, vector set size, vector pair, vector in cpp, vector in c, vector cpp example, vector cpp, vector begin, use of data structures, use of data structure, use of algorithm, time complexity of code, time complexity of an algorithm, time complexity of algorithm, time complexity in data structure, time complexity in c, time complexity in algorithm, time complexity function, time complexity algorithm, the stl

Tietoa työnantajasta:
( 0 arvostelua ) India

Projektin tunnus: #7481883

6 freelanceria on tarjonnut keskimäärin %project_bid_stats_avg_sub_26% %project_currencyDetails_sign_sub_27% tähän työhön

vano101

A proposal has not yet been provided

$98 USD 1 päivässä
(499 arvostelua)
6.6
Shankarone

I can complete this under 2 hours as I have worked on similar projects before . I can assure you 100% satisfaction . I will make changes as per your request (in case you need any)

$15 USD 0 päivässä
(7 arvostelua)
2.1
boejlez

Saya siap melakukan pekerjaan yang anda berikan, jika saya tidak bisa saya akan berusaha semaksimal mungkin yang saya bisa

$25 USD 3 päivässä
(0 arvostelua)
0.0
jagdishrr5

A proposal has not yet been provided

$25 USD 1 päivässä
(0 arvostelua)
0.0
Charmijethani

A proposal has not yet been provided

$25 USD 2 päivässä
(0 arvostelua)
0.0
raviag7

A proposal has not yet been provided

$35 USD 1 päivässä
(0 arvostelua)
0.0