I'm reading GNU sort recently, and it's implementation is almost like this


It's amazing that the sort program running so fast, cuz gnu sort contains like 20+ structure and alot of macros and so on, almost drive me crazy!!!

okay its not what I'm here, this is why I'm here.
Still I havent figure out that how to make
work? I didnt finish read everything of sort, so maybe gnu sort is be able to handle this situation, or it's the job of shell?
I'm trying to clone a simple edition or gnu sort for practice of writing a real program

sort * will take the combined content of all files in the current directory (ecxept those whose name starts with a dot), sort it and write the result to standard output. If some of the files are binaries, the output will look funny, and your terminal may switch to an Amharic font.
Nothing particular is needed to make this work, just type it and enjoy.

Or did you have something else in mind? It's not quite clear to me what you want.

Well, I mean I'm cloning GNU sort program and I wanna know how to make "sort *" works for my sort program...

Your clone needs to take an unlimited number of filename parameters. When you run clone *, the shell will expand the asterisk to the list of files in the current directory, and your clone will have to process all files.

There is a library routine named getopt that will help you with this task.

It's still not clear what you want.

The shell will pass in the list of all files in the current directory. That has nothing to do with your program; by the time your program has been loaded, initialised and set to run, argv is pointing to the start of the char array of list of files.

I can't help you on the method GNU sort uses to speed up its sort as I don't know anything about it.