C Primer - Revision history

Pbug: /* Still doesn't cut it? */

2013-07-28T19:10:21Z

Still doesn't cut it?

← Older revision		Revision as of 12:10, 28 July 2013
Line 2,074:		Line 2,074:
	== Still doesn't cut it? ==		== Still doesn't cut it? ==

	While I was writing this document, I did not go into things such as Binary Searches, Hashes or B-Trees. Nor sorting which is needed to access these methods. These are invaluable methods in programming in that they reduce execution time immensely. The K&R book mentioned at the top goes into this and it shouldn't be overlooked. Also one book that I found invaluable was a follow-up to K&R called "The Practice of Programming" by Brian W. Kernighan and Rob Pike. I use this book for the formulas in the first few chapters.		While I was writing this document, I did not go into things such as [http://en.wikipedia.org/wiki/Binary_search Binary Searches], [http://en.wikipedia.org/wiki/Hash_function Hashes] or [http://en.wikipedia.org/wiki/B-Tree B-Trees]. Nor sorting which is needed to access these methods. These are invaluable methods in programming in that they reduce execution time immensely. The K&R book mentioned at the top goes into this and it shouldn't be overlooked. Also one book that I found invaluable was a follow-up to K&R called "The Practice of Programming" by Brian W. Kernighan and Rob Pike. I use this book for the formulas in the first few chapters.

	== Other Online Tutorials ==		== Other Online Tutorials ==

Pbug: /* Still doesn't cut it? */

2013-07-28T19:02:41Z

Still doesn't cut it?

← Older revision		Revision as of 12:02, 28 July 2013
Line 2,074:		Line 2,074:
	== Still doesn't cut it? ==		== Still doesn't cut it? ==

	While I was writing this document, I did not go into things such as Binary Searches, Hashes or B-Trees. Nor sorting which is needed to access these methods. These are invaluable methods in programming in that they reduce execution time immensely. The K&R book mentioned at the top goes into this and it shouldn't be overlooked. Also one book that I found invaluable was a follow-up to K&R called "~~the practice~~ of ~~programming~~" by Brian W. Kernighan and Rob Pike. I use this book for the formulas in the first few chapters.		While I was writing this document, I did not go into things such as Binary Searches, Hashes or B-Trees. Nor sorting which is needed to access these methods. These are invaluable methods in programming in that they reduce execution time immensely. The K&R book mentioned at the top goes into this and it shouldn't be overlooked. Also one book that I found invaluable was a follow-up to K&R called "The Practice of Programming" by Brian W. Kernighan and Rob Pike. I use this book for the formulas in the first few chapters.

	== Other Online Tutorials ==		== Other Online Tutorials ==

Pbug: /* Integers, Loops and Branches */

2013-07-28T18:57:34Z

Integers, Loops and Branches

← Older revision		Revision as of 11:57, 28 July 2013
Line 389:		Line 389:

	if (count == 0)		if (count == 0)
	printf("you have none left!");		printf("you have none left!\n");
	else if (count == 1)		else if (count == 1)
	printf("you have one left!");		printf("you have one left!\n");
	else		else
	printf("there is plenty left...");		printf("there is plenty left...\n");

	This is how you would fulfil several branches.		This is how you would fulfil several branches.
Line 401:		Line 401:
	switch (count) {		switch (count) {
	case 0:		case 0:
	printf("you have none left!");		printf("you have none left!\n");
	break;		break;
	case 1:		case 1:
	printf("you have one left!");		printf("you have one left!\n");
	break;		break;
	default:		default:
	printf("you have plenty left...");		printf("you have plenty left...\n");
	break;		break;
	}		}
Line 416:		Line 416:
	switch (count) {		switch (count) {
	case 0:		case 0:
	printf("you have none left!");		printf("you have none left!\n");
	break;		break;
	case 1:		case 1:
	/* FALLTHROUGH */		/* FALLTHROUGH */
	default:		default:
	printf("still some left...");		printf("still some left...\n");
	break;		break;
	}		}

	I hope this explains some more branches~~. Please forgive me not putting newlines in I'm on my Mac and can't find the backslash key (argh)..~~.		I hope this explains some more branches.

	== Pointers, Variables and Variables of some sorts ==		== Pointers, Variables and Variables of some sorts ==

Pbug: /* Still doesn't cut it? */ someone hit the turbo button without me knowing?

2013-07-28T00:10:04Z

Still doesn't cut it?: someone hit the turbo button without me knowing?

← Older revision		Revision as of 17:10, 27 July 2013
Line 2,074:		Line 2,074:
	== Still doesn't cut it? ==		== Still doesn't cut it? ==

	While I was writing this document, I did not go into things such as Binary Searches, Hashes or B-Trees. Nor sorting which is needed to access these methods. These are invaluable methods in programming in that they ~~speed up~~ execution time immensely. The K&R book mentioned at the top goes into this and it shouldn't be overlooked. Also one book that I found invaluable was a follow-up to K&R called "the practice of programming" by Brian W. Kernighan and Rob Pike. I use this book for the formulas in the first few chapters.		While I was writing this document, I did not go into things such as Binary Searches, Hashes or B-Trees. Nor sorting which is needed to access these methods. These are invaluable methods in programming in that they reduce execution time immensely. The K&R book mentioned at the top goes into this and it shouldn't be overlooked. Also one book that I found invaluable was a follow-up to K&R called "the practice of programming" by Brian W. Kernighan and Rob Pike. I use this book for the formulas in the first few chapters.

	== Other Online Tutorials ==		== Other Online Tutorials ==

Pbug: /* Integers, Loops and Branches */ a long needed addendum for if/else if/else, switch()/case/break

2013-07-28T00:00:35Z

Integers, Loops and Branches: a long needed addendum for if/else if/else, switch()/case/break

@@ Line 385: / Line 385: @@
 count lines.  You see here that Hello, World was printed 9 times.  Thank
 goodness for pipes or this example would be extremely boring.
 == Pointers, Variables and Variables of some sorts ==

Pbug: /* External Libraries */ more to say...

2013-07-27T15:29:09Z

External Libraries: more to say...

← Older revision		Revision as of 08:29, 27 July 2013
Line 2,029:		Line 2,029:
	32 }		32 }



			== Still doesn't cut it? ==

			While I was writing this document, I did not go into things such as Binary Searches, Hashes or B-Trees. Nor sorting which is needed to access these methods. These are invaluable methods in programming in that they speed up execution time immensely. The K&R book mentioned at the top goes into this and it shouldn't be overlooked. Also one book that I found invaluable was a follow-up to K&R called "the practice of programming" by Brian W. Kernighan and Rob Pike. I use this book for the formulas in the first few chapters.

	== Other Online Tutorials ==		== Other Online Tutorials ==

Pbug: /* Character Arrays and Linked Lists */ spelling lengthy

2012-02-21T15:56:50Z

Character Arrays and Linked Lists: spelling lengthy

← Older revision		Revision as of 08:56, 21 February 2012
Line 1,120:		Line 1,120:
	== Character Arrays and Linked Lists ==		== Character Arrays and Linked Lists ==

	If you've followed the 10 previous chapters you may have learned quite a bit. We know now how to create a program that perhaps reads from a configuration file and sets variables based on that configuration file. This is simple. But what if the configuration file holds lists of input such as IP numbers? Pretend you're writing a program that pings IP numbers every minute and does some action if an IP does not ping. You could re-read the IP list every loop but this is likely going to be slow and the costs are much higher due to access to the disk device every time. What you could do is buffer (or cache) the list of IP's in memory and read from that instead, saving you the disk access to only 1 time. Consider this next ~~lenghty~~ program:		If you've followed the 10 previous chapters you may have learned quite a bit. We know now how to create a program that perhaps reads from a configuration file and sets variables based on that configuration file. This is simple. But what if the configuration file holds lists of input such as IP numbers? Pretend you're writing a program that pings IP numbers every minute and does some action if an IP does not ping. You could re-read the IP list every loop but this is likely going to be slow and the costs are much higher due to access to the disk device every time. What you could do is buffer (or cache) the list of IP's in memory and read from that instead, saving you the disk access to only 1 time. Consider this next lengthy program:

	1 #include <stdio.h>		1 #include <stdio.h>

Pbug: /* The UNIX Interface */ pipeline -> pipe

2012-02-21T15:45:51Z

The UNIX Interface: pipeline -> pipe

← Older revision		Revision as of 08:45, 21 February 2012
Line 92:		Line 92:
	pipe (symbol \| on the command prompt) allows one to direct the output of one		pipe (symbol \| on the command prompt) allows one to direct the output of one
	program into the input of another program and thus you create what is called		program into the input of another program and thus you create what is called
	a pipeline. A [[pipeline]] uses different programs that specialize on one task		a pipeline. A [[pipe\|pipeline]] uses different programs that specialize on one task
	to shape the output at the end into something useable. Take this example		to shape the output at the end into something useable. Take this example
	of the previous text; if I did:		of the previous text; if I did:

Pbug: /* Other Online Tutorials */ more links gathered from IRC

2011-12-15T17:21:08Z

Other Online Tutorials: more links gathered from IRC

← Older revision		Revision as of 10:21, 15 December 2011
Line 2,035:		Line 2,035:

	* [http://programming.coreth.com/c/ Introduction to C]		* [http://programming.coreth.com/c/ Introduction to C]
			* [http://beej.us/guide/bgnet/output/html/singlepage/bgnet.html Beej's Guide to Network Programming]
			* [http://publications.gbdirect.co.uk/c_book/ The C Book]

Pbug: /* Other Online Tutorials */

2011-12-15T16:43:13Z

← Older revision		Revision as of 09:43, 15 December 2011
Line 2,031:		Line 2,031:

	== Other Online Tutorials ==		== Other Online Tutorials ==

			If you're looking for more works for free online tutorials there is finished and works in progress, I'll list some here:

			* [http://programming.coreth.com/c/ Introduction to C]