├── .gitattributes
├── Algorithms
    ├── Algorithms.cbp
    ├── Algorithms.layout
    ├── bin
    │   └── Debug
    │   │   └── Algorithms
    └── obj
    │   └── Debug
    │       └── test.o
├── LinearSearch.c
├── Sorting.c
├── line
├── sort
├── test
├── test.c
└── test.o


/.gitattributes:
--------------------------------------------------------------------------------
1 | # Auto detect text files and perform LF normalization
2 | * text=auto
3 | 


--------------------------------------------------------------------------------
/Algorithms/Algorithms.cbp:
--------------------------------------------------------------------------------
 1 | <?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
 2 | <CodeBlocks_project_file>
 3 | 	<FileVersion major="1" minor="6" />
 4 | 	<Project>
 5 | 		<Option title="Algorithms" />
 6 | 		<Option pch_mode="2" />
 7 | 		<Option compiler="gcc" />
 8 | 		<Build>
 9 | 			<Target title="Debug">
10 | 				<Option output="bin/Debug/Algorithms" prefix_auto="1" extension_auto="1" />
11 | 				<Option object_output="obj/Debug/" />
12 | 				<Option type="1" />
13 | 				<Option compiler="gcc" />
14 | 				<Compiler>
15 | 					<Add option="-g" />
16 | 				</Compiler>
17 | 			</Target>
18 | 			<Target title="Release">
19 | 				<Option output="bin/Release/Algorithms" prefix_auto="1" extension_auto="1" />
20 | 				<Option object_output="obj/Release/" />
21 | 				<Option type="1" />
22 | 				<Option compiler="gcc" />
23 | 				<Compiler>
24 | 					<Add option="-O2" />
25 | 				</Compiler>
26 | 				<Linker>
27 | 					<Add option="-s" />
28 | 				</Linker>
29 | 			</Target>
30 | 		</Build>
31 | 		<Compiler>
32 | 			<Add option="-Wall" />
33 | 		</Compiler>
34 | 		<Unit filename="../test.c">
35 | 			<Option compilerVar="CC" />
36 | 		</Unit>
37 | 		<Extensions />
38 | 	</Project>
39 | </CodeBlocks_project_file>
40 | 


--------------------------------------------------------------------------------
/Algorithms/Algorithms.layout:
--------------------------------------------------------------------------------
 1 | <?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
 2 | <CodeBlocks_layout_file>
 3 | 	<FileVersion major="1" minor="0" />
 4 | 	<ActiveTarget name="Debug" />
 5 | 	<File name="../test.c" open="1" top="1" tabpos="1" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
 6 | 		<Cursor>
 7 | 			<Cursor1 position="63" topLine="0" />
 8 | 		</Cursor>
 9 | 	</File>
10 | </CodeBlocks_layout_file>
11 | 


--------------------------------------------------------------------------------
/Algorithms/bin/Debug/Algorithms:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/teddyoweh/Algorithms-in-C/9c5ca2978b90ce7fbe3e2390cc2b4a2c4773c218/Algorithms/bin/Debug/Algorithms


--------------------------------------------------------------------------------
/Algorithms/obj/Debug/test.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/teddyoweh/Algorithms-in-C/9c5ca2978b90ce7fbe3e2390cc2b4a2c4773c218/Algorithms/obj/Debug/test.o


--------------------------------------------------------------------------------
/LinearSearch.c:
--------------------------------------------------------------------------------
 1 | #include <stdio.h>
 2 | 
 3 | #define MAX 20
 4 | 
 5 |  
 6 | int intArray[MAX] = {1,2,3,4,6,7,9,11,12,14,15,16,17,19,33,34,43,45,55,66};
 7 | 
 8 |  
 9 | 
10 |   
11 | int find(int data) {
12 | 
13 |    int comparisons = 0;
14 |    int index = -1;
15 |    int i;
16 | 
17 |  
18 |    for(i = 0;i<MAX;i++) {
19 | 	
20 |       comparisons++;
21 |       if(data == intArray[i]) {
22 |          index = i;
23 |          break;
24 |       }
25 |    }   
26 | 	
27 |  
28 |    return index;
29 | }
30 | 
31 | void display() {
32 |    int i;
33 |    printf("[");
34 |    for(i = 0;i<MAX;i++) {
35 |       printf("%d ",intArray[i]);
36 |    }
37 | 	
38 |    printf("]\n");
39 | }
40 | 
41 | void main() {
42 |    printf("Input Array: ");
43 |    display();
44 |  
45 | 	
46 | 
47 |    int location = find(55);
48 | 
49 |  
50 |    if(location != -1)
51 |       printf("\nElement found at location: %d" ,(location+1));
52 |    else
53 |       printf("Element not found.");
54 | }


--------------------------------------------------------------------------------
/Sorting.c:
--------------------------------------------------------------------------------
 1 | #include <stdio.h> 
 2 |  
 3 | void swap(int *a, int *b) 
 4 | { 
 5 | int temp = *a; 
 6 | *a = *b; 
 7 | *b = temp; 
 8 | }  
 9 |  
10 | void bubbleSort(int array[], int n) 
11 | { 
12 | int i, j; 
13 | for (i = 0; i < n-1; i++)       
14 | for (j = 0; j < n-i-1; j++) if (array[j] > array[j+1]) 
15 | swap(&array[j], &array[j+1]); 
16 | }    
17 | void printArray(int array[], int size) 
18 | { 
19 | int i; 
20 | for (i=0; i < size; i++) 
21 | printf("%d ", array[i]); 
22 | printf("n"); 
23 | }   
24 |  
25 | int main() 
26 | { 
27 | int array[] = {89, 32, 20, 113, -15}; 
28 | int size = sizeof(array)/sizeof(array[0]); 
29 | bubbleSort(array, size); 
30 | printf("Sorted array: n"); 
31 | printArray(array, size); 
32 | return 0; 
33 | }


--------------------------------------------------------------------------------
/line:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/teddyoweh/Algorithms-in-C/9c5ca2978b90ce7fbe3e2390cc2b4a2c4773c218/line


--------------------------------------------------------------------------------
/sort:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/teddyoweh/Algorithms-in-C/9c5ca2978b90ce7fbe3e2390cc2b4a2c4773c218/sort


--------------------------------------------------------------------------------
/test:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/teddyoweh/Algorithms-in-C/9c5ca2978b90ce7fbe3e2390cc2b4a2c4773c218/test


--------------------------------------------------------------------------------
/test.c:
--------------------------------------------------------------------------------
 1 | #include <stdio.h>    
 2 |      
 3 | int main()    
 4 | {    
 5 |     //Initialize array     
 6 |     int arr[] = {1, 2, 3, 4, 5};     
 7 |     //Calculate length of array    
 8 |     int length = sizeof(arr)/sizeof(arr[0]);    
 9 |         
10 |      
11 |     //Loop through the array by incrementing value of i     
12 |     for (int i = 0; i < length; i++) {     
13 |         for( int k = `)     
14 |     }      
15 |      
16 |     return 0;    
17 | }      


--------------------------------------------------------------------------------
/test.o:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/teddyoweh/Algorithms-in-C/9c5ca2978b90ce7fbe3e2390cc2b4a2c4773c218/test.o


--------------------------------------------------------------------------------