The goal of this lab is to give all of you some initial practice with C.
Make a folder for this lab and move into it.
mkdir lab1 cd lab1
As in most labs and projects, I am giving you some code base to work on. Copy the following files from the course directory for this lab.
cp /homes/tvandrun/Public/cs245/lab1/* .
This gives you nine files:
sort_util.h
and sort_util.c
give the header file and implementation file, respectively, of
a library that provides some functions that support testing
array-sorting functions.
test_substring.c
and test_selection.c
,
the driver programs that will test the code that you write.
makefile
, the file that describes how to compile
the code for today.
selection.h
, and substring.h
,
header files containing the protocol for the function you will write.
selection.c
and substring.c
,
the implementation files for the code you will write.
These last two are the only files that you will need to modify.
Open selection.c
in gedit, emacs, or xemacs.
You will see it contains only a basic stub
for the selection_sort
function.
This function takes (a reference to) an array and the size of the array
n
.
Implement the selection sort algorithm:
i
be the boundary position between the sorted
and unsorted sections; the array from 0 inclusive to i
exclusive is sorted, and from i
inclusive to n
exclusive is unsorted.
i
i
(moving the boundary, that is,
making the sorted section grow and unsorted section shrink)
Compile your code using
gcc -c selection.c
Once you have fixed any compilation errors, you can compile and link the utility library and driver program for selection sort:
gcc -c sort_util.c gcc -c test_selection.c gcc test_selection.o sort_util.o selection.o -o test_selection
Seem like a lot of steps? Then just use the make
command:
make test_selection
Once it all compiles, run the driver using
./test_selection
Use the results of the driver program to debug your implementation of selection sort.
You should remember the Java method substring()
by which you can make a new string from a sequence of characters
from another string.
You will write a similar function in C.
The protocol for the function you will write (you'll find this protocol
in substring.h
and a stub in substring.c
;
open the latter) is
int substring(char source[], char destination[], int start, int stop);
Note that this function takes (references to) two arrays---the first
is the array we are copying from, the second is the array we are copying
the characters to.
You don't need to know their sizes; all you care about is where the string
ends (you have to assume that the arrays are big enough to hold the
respective strings).
The function also takes a starting index (inclusive) and
stopping index (exclusive).
It copies the subsequence source[start, stop]
to destination[0, stop-start]
and adds an end-of-string marker to position
stop-start
.
However, to make this function extra robust, we want to make it
work even when "bad" values for start
and stop
are given.
Here are the rules:
start
is negative, we will assume they meant 0.
stop
is less than or equal to start
or if start
comes after the end-of-string marker,
this function will copy a "trivial" string of length 0.
stop
comes after the end-of-string marker,
this function will copy only to the end-of-string marker.
start
and
stop
are valid indices ("normal") and 0 if at least one of them
are out of bounds ("bad").
Don't forget that the "destination" string must end in an end-of-string marker, even if a no characters are copied.
Compile with
make test_substring
Test with
./test_substring