Learning Objectives At the end of this project, you are expected to be able to explain to anyone, without the help of Google: General Why C programming is awesome (don’t forget to tweet today, with the hashtag #cisfun :)) Who invented C Who are Dennis Ritchie, Brian Kernighan and Linus Torvalds What happens when you type gcc main.c What is an entry point What is main How to print text using printf, puts and putchar How to get the size of a specific type using the unary operator sizeof How to compile using gcc What is the default program name when compiling with gcc What is the official Holberton C coding style and how to check your code with betty-style How to find the right header to include in your source code when using a standard library function How does the main function influence the return value of the program Requirements C Allowed editors: vi, vim, emacs All your files will be compiled on Ubuntu 14.04 LTS using gcc 4.8.4 All your files should end with a new line A README.md file at the root of the holbertonschool-low_level_programming repo, containing a description of the repository A README.md file, at the root of the folder of this project, containing a description of the project There should be no errors and no warnings during compilation You are not allowed to use system Your code should use the Betty style. It will be checked using betty-style.pl and betty-doc.pl Shell Scripts Allowed editors: vi, vim, emacs All your scripts will be tested on Ubuntu 14.04 LTS All your scripts should be exactly two lines long ($ wc -l file should print 2) All your files should end with a new line The first line of all your files should be exactly #!/bin/bash
Stars
3
Forks
3
Watchers
3
Open Issues
0
Overall repository health assessment
No package.json found
This might not be a Node.js project
535
commits
time complexity (average case) of a jump search in an array of size n, using step = sqrt(n)
d8a8eebView on GitHubthe space complexity (worst case) of a binary search in an array of size n
5bddedaView on GitHubtime complexity (worst case) of a binary search in an array of size n
5df136fView on GitHubspace complexity (worst case) of an iterative linear search algorithm in an array of size n
e29e131View on GitHubspace complexity (worst case) of an iterative linear search algorithm in an array of size n
bf26685View on GitHubspace complexity (worst case) of an iterative linear search algorithm in an array of size n
2ba7bd7View on GitHubspace complexity (worst case) of an iterative linear search algorithm in an array of size n
bf2df0dView on GitHubtime complexity (worst case) of a linear search in an array of size n
c389cc7View on GitHub