RCS file: BinarySearch.c,v
Working file: BinarySearch.c
head: 1.4
branch:
locks: strict
root: 1.4
access list:
symbolic names:
keyword substitution: kv
total revisions: 4; selected revisions: 4
description:
This is the program that will sort the given array.
So, the pre-requisite for binary search is met.
----------------------------
revision 1.4 locked by: root;
date: 2015/02/07 07:28:34; author: root; state: Exp; lines: +5 -0
checking for the element at mid location.
----------------------------
revision 1.3
date: 2015/02/07 07:26:46; author: root; state: Exp; lines: +4 -1
Declared key.
Took the key input valu to find in the array.
----------------------------
revision 1.2
date: 2015/02/07 07:19:36; author: root; state: Exp; lines: +5 -1
Declared variables l, h, m.
Initialized all these variables.
----------------------------
revision 1.1
date: 2015/02/07 07:13:50; author: root; state: Exp;
Initial revision
=============================================================================
It looks like you're new here. If you want to get involved, click one of these buttons!