Minimum Set Cover Problem using Greedy Algorithm

The well-known problem of set covering is coded in this Matlab file using the greedy algorithm. The input to this program is an array appended with zeros at the end like the below example.
The output is selected rows indicated with 1. (1 denotes the row is selected and 0 denotes the rows are not selected).

Sample Input
(r1 to r8 label is just for reference and doesn't belong to the part of the array)

r1: 7 8 12 0 0 0
r2: 1 2 3 0 0 0
r3: 3 5 6 0 0 0
r4: 6 7 8 9 0 0
r5: 10 11 0 0 0 0
r6: 4 5 6 7 0 0
r7: 8 9 10 0 0 0
r8: 1 2 3 4 5 6

Output
{1 0 0 1 1 0 0 1}