close(fd2);
return 1;
} else {
- if(strncmp(buffer1, buffer2, s1)) {
+ if(memcmp(buffer1, buffer2, s1)) {
close(fd1);
close(fd2);
return 0;
qsort(nodes, nb, sizeof(struct file_with_size *), compare_nodes);
for(n = 0; n < nb; n++) {
+ if(!show_groups && n > 0 && nodes[n]->group_id != nodes[n-1]->group_id) {
+ printf("\n");
+ }
print_file(nodes[n]);
}