This lab should be done with your assigned partner:
The expectation is that you and your partner are working together side by side in the lab for most, if not all, of the time you work on a lab assignments. You and your partner should work on all aspects of the project together: initial top-down design, incremental testing and debugging, and final stress testing and code review. There may be short periods of time where you each go off and impelement some small part independently. However, you should frequently come back together, talk through your changes, push and pull each others code from the repo and try out your merged code together. Taking time to design a plan for your solution together and to do incremental implementation and testing together may seem like it is a waste of time, but in the long run it will save you a lot of time by making it less likely that you have design or logic errors in your solution, and by having a partner to help track down bugs and to help come up with solutions to problems.
Partnerships where partners work mostly independently rarely work out well and rarely result in complete, correct and robust solutions. Partnerships where partners work side-by-side for all or most of the time tend to work out very well.
You and your partner are equally responsible for scheduling times when you can meet to work together, and for making time available in your schedule for working together.
Both you and your partner should do:
cd ~/cs31/labs
git clone [your_Lab2_URL]
ls Makefile README.md floats2.txt floatsbig.txt readfile.h QUESTIONNAIRE floats.txt floats3.txt readfile.c sorter.cIf this didn't work, or for more detailed instructions see the the Using git page.
As you and your partner work on your joint solution, you will want to push and pull changes from the master into your local repo.
We will do this together in Wednesday lab:
Try out git push and pull before working on lab 2 code:
Also, it is good practice to do a make clean before doing a git add and commit: you do not want to add to the repo any files that are built by gcc (e.g. executable files). Included in your Lab2 git repo is a .gitignore file telling git to ignore these files, so you likely won't add these types of files by accident. However, if you have other gcc generated binaries in your repo, please be careful about this.
You will implement program that sorts floating point numbers using a sorting algorithm of your choice in C. Your program will read a collection of unsorted floats from a file, store those floats in an array, provide some information about the floats to the user, sort them from smallest to largest (i.e., ascending order), and print them out in sorted form to the user.
make make cleanWe will look at writing Makefiles later in the semester. You're welcome to look at its contents now, but you do not need to edit it for this lab.
To compile your program, run make, which will use the Makefile to build your program (and link in the provided readfile library). Running make will show you the compiler output, which you should examine for errors and warnings. There is one unused variable warning with the starting point code that will go away when you write code that uses this variable.
$ make gcc -g -Wall -Wvla -Werror -Wno-error=unused-variable -c readfile.c gcc -g -Wall -Wvla -Werror -Wno-error=unused-variable -o sorter sorter.c readfile.o sorter.c: In function 'main': sorter.c:30:9: warning: unused variable 'values' [-Wunused-variable] float values[ARRAYSIZE];
Your program will take one command line argument: the name of the input file containing floating point values to sort, one on each line. It should read values from the file (using the provided library), print the unsorted values, sort them, and print out the sorted result back to the user. Here is an example of how you invoke the program:
$ ./sorter floats.txt
The input file format consists of several lines of an ASCII text file. A properly formatted file will contain a short header, consisting of a single line with one integer and two floats on it. These numbers represent the total number of floats in the file (i.e., the number of subsequent lines), as well as the minimum and maximum to-be-sorted float value in the file. These numbers will be written like this:
For example, here is the header of a valid input file:
4 0.0 9.0
This header indicates that the file contains a total of 4 floats that need to be sorted. The smallest float value in the file will be 0.0, and the largest will be 9.0. You may not need to know the minimum and maximum values to successfully sort the values, but you will need to inform the user about the range of values being sorted.
Included with the starting point code are a few sample test files you can use to test your code. Every line after the first line in the file will contain a single floating point number. These are the float values that must be sorted. For example, a file containing the header we just saw might look like this (after the first line):
0.0 2.1 9.0 5.3
For this assignment we'll use functions from the provided readfile library (in the files readfile.c and readfile.h). You should not change any code in these files. The readfile.h file contains function prototypes for the readfile library. There are function comments in this file that describe each function and a high-level comment that describes how to use the library.
Here are the general rules for how to use these functions:
These functions take arguments much like scanf does: they need to know
the memory location of where to put the value read in.
For example:
int x; float f; char s[20]; ... /* These functions return 0 on success or -1 if read fails or * if there is nothing left to read (end-of-file has been reached). */ ret = read_float(&f); ret = read_int(&x) ret = read_string(s)
If you are curious, the implementation of these functions is in readfile.c. You can take a look and see how it uses the C FILE * interface and fscanf functions for reading. We will use this interface directly later in the semester. For now, we're hiding it under a layer of abstraction.
Your program's output should look like this: output from an example run. It doesn't show every possible run or error handling, but should give you some idea of what a correct program will look like. To make my job of grading easier, please make your output match the example as closely as possible.
For full credit, your solution should meet the following requirements:
Look at my C style Guide For example of good comments, how not to wrap lines and some tips for breaking up long statements into multiple lines of C code, good indenting style, and suggetions for good function and variable naming in your programs.
The following is the suggested way to implement the lab and fulfill the requirements. If you intend to significantly deviate from this design, please let me know so that I can do a basic sanity check of your proposed changes.
gdb ./sorter (gdb) break main (gdb) run floats.txt
From one of your local repos (in your ~you/cs31/labs/Lab2-partner1-partner2 subdirectory)
git push
git add sorter.c git add QUESTIONNAIRE git commit git pushAnother likely source of a failed push is that your partner pushed, and you have not pulled their changes. Do a git pull. Compile and test that your code still works. Then you can add, commit, and push.
If that doesn't work, take a look at the "Troubleshooting" section of the Using git page. You may need to pull and merge some changes from master into your local. If so, this indicates that your partner pushed changes that you have not yet merged into your local. Anytime you pull into your local, you need to check that your code still works before submitting.