Directories Updated

* Merged 2 sorts folder
* Merged 2 conversion folder
* Merged 2 search folder
* Renamed Computer Oriented Statistical Methods

Conversions/Binary To Decimal.c

@@ -1,17 +0,0 @@
-#include<stdio.h>
-#include<conio.h>
-int main() {
-	int number, decimal_number, temp=1;
-	printf("Enter any binary number= ");
-	scanf("%d", &number);
-    int remainder;
-	while(number>0) {
-	
-		remainder = number%10;
-		number = number/10;
-		decimal_number += remainder*temp;
-		temp = temp*2;//used as power of 2
-	
-	}
-	printf("%d",decimal_number);
-}

Searches/BinarySearch.c

@@ -1,39 +0,0 @@
-#include <stdio.h>
-
-// Recursive Function- It returns location of x assumiung array arr[l..r] is present, otherwise -1
-
-int binarysearch(int arr[], int l, int r, int x)
-{
-   if (r >= l)
-   {
-        int mid = l + (r - l)/2;
-
-        // If element is present at middle
-        if (arr[mid] == x)  return mid;
-
-        // If element is smaller than middle
-        if (arr[mid] > x) return binarysearch(arr, l, mid-1, x);
-
-        // Else element is in right subarray
-        return binarysearch(arr, mid+1, r, x);
-   }
-
-   // When element is not present in array
-   return -1;
-}
-
-int main(void)
-{
-   // give function an array to work with
-   int arr[] = {2, 3, 4, 10, 40};
-   // get size of array
-   int n = sizeof(arr)/ sizeof(arr[0]);
-   //set value to look for
-   int x = 10;
-   // set result to what is returned from binarysearch
-   int result = binarysearch(arr, 0, n-1, x);
-   // print out result
-   (result == -1)? printf("Element is not in the array")
-                 : printf("Element is present at index %d", result);
-   return 0;
-}

Sorts/BogoSort.c

@@ -1,40 +0,0 @@
-#include <stdio.h>
-#include <stdlib.h>
-#include <stdbool.h>
-
-bool check_sorted(int *a, int n)
-{
-  while ( --n >= 1 ) {
-    if ( a[n] < a[n-1] ) return false;
-  }
-  return true;
-}
-
-void shuffle(int *a, int n)
-{
-  int i, t, r;
-  for(i=0; i < n; i++) {
-    t = a[i];
-    r = rand() % n;
-    a[i] = a[r];
-    a[r] = t;
-  }
-}
-
-void sort(int *a, int n)
-{
-  while ( !check_sorted(a, n) ) shuffle(a, n);
-}
-
-int main()
-{
-  int numbers[6];
-  int i;
-  printf("Enter 6 numbers unsorted \n\n");
-  for(i=0;i<6;i++){
-  scanf("%d",&numbers[i]);
-  }
-  sort(numbers, 6);
-  for (i=0; i < 6; i++) printf("%d ", numbers[i]);
-  printf("\n");
-}

Sorts/BubbleSort.c

@@ -1,40 +0,0 @@
-#include <stdio.h>
-#include <stdlib.h>
-
-
-int main(){
-
-    int* ARRAY=NULL;
-    int ContinueFilling=1; //This is to know if we should continue filling our array
-    int ARRAY_LENGTH=0,isSorted=0,i,TEMPORARY_ELEMENT;
-
-    //This code part is for filling our array
-    while(ContinueFilling){
-        printf("Enter the value number %d \n",ARRAY_LENGTH+1);
-        ARRAY=(int *)realloc(ARRAY,sizeof(int)*(ARRAY_LENGTH));
-        scanf("%d",&ARRAY[ARRAY_LENGTH]);
-        ARRAY_LENGTH+=1;
-        printf("would you enter an other value (1:Continue/0:Sort the actual array)?\n");
-        scanf("%d",&ContinueFilling);
-    }
-
-    //Then we sort it using Bubble Sort..
-
-    while(!isSorted){ //While our array's not sorted
-        isSorted=1; //we suppose that it's sorted
-        for(i=0;i<ARRAY_LENGTH-1;i++){ //then for each element of the array
-            if(ARRAY[i]>ARRAY[i+1]){  // if the two elements aren't sorted
-                isSorted=0;    //it means that the array is not sorted
-                TEMPORARY_ELEMENT=ARRAY[i]; //and we switch these elements using TEMPORARY_ELEMENT
-                ARRAY[i]=ARRAY[i+1];
-                ARRAY[i+1]=TEMPORARY_ELEMENT;
-            }
-        }
-    }
-    //And we display it
-    for(i=0;i<ARRAY_LENGTH;i++){
-        printf("%d, ",ARRAY[i]);
-    }
-
-    return 0;
-}

Sorts/InsertionSort.c

@@ -1,29 +0,0 @@
-#include <stdio.h>
-#incude  <stdlib.h>
-#define MAX 20
-
-
-
-int main()
-{
-    int i, elmtToInsert , j , arraySort[MAX] = {0};
-
-        for(i = 1 ; i < MAX ;  i++)
-        {
-            elmtToInsert = arraySort[i];
-            j = i - 1 ;
-
-            while( j >= 0 && elmtToInsert < arraySort[j])
-            {
-                arraySort[j+1] = arraySort[j];
-                j--;
-            }
-
-            arraySort[j+1] = elmtToInsert ;
-        }
-
-
-
-
-    return EXIT_SUCCESS;
-}

Sorts/OtherBubbleSort.c

@@ -1,56 +0,0 @@
-#include <stdio.h>
-#include <stdlib.h>
-#define MAX 20 
-#define TRUE 1
-#define FALSE 0
-
-
-int main()
-{
-
-    int i , arraySort[MAX] ={0} ,  isSort = FALSE, changePlace;
-    
-    
-    /* For example 
-    Insertion random values in array to test
-    */
-    
-    
-    for(i = 0 ; i < MAX; i++)
-    {
-        arraySort[i] = rand()%101 ;
-    }
-    
-
-/* Algorithm of bubble methods */
-    
-    while(isSort)
-    {
-         isSort = FALSE;
-
-         for( i = 0 ; i < MAX - 1 ; i++)
-         {
-              if(arraySort[i] > arraySort[i+1])
-              {
-                 changePlace = arratSort[i];
-                 arraySort[i] = arraySort[i+1];
-                 arraySort[i+1] = changePlace ;
-                 isSort = TRUE;
-              }
-         
-         }
-    }
-
-    /* See if it works */
-    
-    for(i = 0 ; i < MAX; i++)
-    {
-       printf("%d\n", arraySort[i]);
-    }
-
-
-
-
-    return EXIT_SUCCESS;
-
-}