Binary Search

spatlou

niranjan

output:

ani@ani-VirtualBox:~/share_data/project/P01_C_project/s06_array$ ls
arryPointer     binarySearch.o creatArray.o    displayArray.o exitFunc.o linearSearch.c main.c      mainMenu.o Makefile
binarySearch.c creatArray.c    displayArray.c exitFunc.c      header.h    linearSearch.o mainMenu.c main.o      prototype.h
ani@ani-VirtualBox:~/share_data/project/P01_C_project/s06_array$ ./arryPointer
main 13: Start program
main 14: Address of auto/stack :: choice=0xbfdaafd4 pos=0xbfdaafd8 arr=0xb7778000
mainMenu 12: Begin ..
mainMenu 13: 0 -> Exit the Program.
mainMenu 14: 1 -> Create Array.
mainMenu 15: 2 -> Linear Search In Array.
mainMenu 16: 3-> Dispaly Array.
mainMenu 17: 4 -> Binary Serch In Sorted Array.
mainMenu 18: Enter the choice Menu
1
mainMenu 20: choice 1     END ...
creatArray 13: Begin
creatArray 14: Address of local *carr Pointer=0x1 before Memory Allocation using malloc
creatArray 21: Enter Element 10 times!! After Memory allocation *carr Pointer address=0x9f72008
10
20
30
40
50
60
70
80
90
100
creatArray 28: array pointer address=0x9f72008    END ....
mainMenu 12: Begin ..
mainMenu 13: 0 -> Exit the Program.
mainMenu 14: 1 -> Create Array.
mainMenu 15: 2 -> Linear Search In Array.
mainMenu 16: 3-> Dispaly Array.
mainMenu 17: 4 -> Binary Serch In Sorted Array.
mainMenu 18: Enter the choice Menu
4
mainMenu 20: choice 4     END ...
binarySearch 14: Begin ..
binarySearch 15: Address of low=0xbfdaaf90 key =0xbfdaaf98 ->high =0xbfdaaf94
binarySearch 16: Enter element to search in sorted Array ..
70
binarySearch 21: low =0 high=9 mid =0 key =70
binarySearch 52: low =5 high=9 mid =4 key =70
binarySearch 52: low =5 high=6 mid =7 key =70
70 Element Found!! in Arry -->arr[6]
mainMenu 12: Begin ..
mainMenu 13: 0 -> Exit the Program.
mainMenu 14: 1 -> Create Array.
mainMenu 15: 2 -> Linear Search In Array.
mainMenu 16: 3-> Dispaly Array.
mainMenu 17: 4 -> Binary Serch In Sorted Array.
mainMenu 18: Enter the choice Menu
4
mainMenu 20: choice 4     END ...
binarySearch 14: Begin ..
binarySearch 15: Address of low=0xbfdaaf90 key =0xbfdaaf98 ->high =0xbfdaaf94
binarySearch 16: Enter element to search in sorted Array ..
65
binarySearch 21: low =0 high=9 mid =0 key =65
binarySearch 52: low =5 high=9 mid =4 key =65
binarySearch 52: low =5 high=6 mid =7 key =65
binarySearch 52: low =6 high=6 mid =5 key =65
65 Element not found!! In Arry Pointer
binarySearch 57: END ..
mainMenu 12: Begin ..
mainMenu 13: 0 -> Exit the Program.
mainMenu 14: 1 -> Create Array.
mainMenu 15: 2 -> Linear Search In Array.
mainMenu 16: 3-> Dispaly Array.
mainMenu 17: 4 -> Binary Serch In Sorted Array.
mainMenu 18: Enter the choice Menu

Query:

1. I try to Memory map of above program. But Not very clear picture memory map regarding pointer address & use in local pointer

2.In above output, print auto variable, pointer. How to define stack/ heap decleation?

3.In our system, how to define stack size, heap, data & code segment area ? or some default configuration

4. After compile code generate either in elf / bin / hex format , But last this store in HDD/ flash location.

when run program, which resource to handle to load flash/HDD to memory area?
How to handle stack, code & data segment area in memory?

niranjan

code of binary search :

if((*(arr+low) <= key) && (*(arr +high) >= key))
        {
                do
                {
                        if(arr[low] == key)
                        {
                                printf("%d Element Found!! in Arry -->arr[%d]\n",key,low);
                                return low;

                        }else if(arr[high] == key)
                        {
                                printf("%d Element Found!! in Arry -->arr[%d]\n",key,high);
                                return high;
                        }else
                        {
                                mid = (low + high)/2;
                                if(arr[mid] == key)
                                {
                                        printf("%d Element Found!! in Arry -->arr[%d]\n",key,mid);
                                        return mid;
                                }else if(arr[mid] > key)
                                {
                                        high = mid -1;
                                }else
                                {
                                        low = mid +1;
                                }
                        }
                        printf("%s %d: low =%d high=%d mid =%d key =%d \n", __func__,__LINE__,low ,high, mid ,key);

                }while(low < high);
        }
        printf("%d Element not found!! In Arry Pointer\n",key);

mdaliakbar

Binary Search use to Divide and Conquer Algorithm.

This is a problem-solving technique used to solve problems by dividing the main problem into subproblems, solving them individually and then merging them to find solution to the original problem.

Binary Search

Howdy, Stranger!

Categories