Binary Search - ticalc.org

Basics	Archives	Community	Services	Programming
Hardware	Help	About	Search	Your Account

Home :: Archives :: File Archives :: Binary Search

Binary Search

FILE INFORMATION

Ranked as 27950 on our all-time top downloads list with 929 downloads.
Ranked as 4797 on our top downloads list for the past seven days with 4 downloads.

bisearch.zip

Filename	bisearch.zip
Title	Binary Search
Description	A simple easy to use binary searching algorith used to search lists for specific elements. Saves the index of the element in a variable called 'Index'. If the element is not found, index = 0. A binary search is much much faster than a sequential search, so if your looking for speed, this is it. This is ideal when searching lists that are very large. A sequential search takes an average of 6.5s to search a 100 element list while a binary search takes an average of 0.5s to search the same list for the same element. This is great for programmers so be sure to try it out. :)
Author	Eric Pasch (epasch@gmail.com)
Category	TI-89 BASIC Misc. Programs (Utils/Data)
File Size	873 bytes
File Date and Time	Mon Sep 6 06:49:05 2004
Documentation Included?	Yes

SCREEN SHOTS

RATING

If you have downloaded and tried this program, please rate it on the scale below

REVIEWS

There are no reviews for this file. Do you want to write one?

ARCHIVE CONTENTS

Archive Contents

Name	Size
main.bisearch.89p	514
readme.txt	650

HELP US IMPROVE OUR FILE ARCHIVE

We at ticalc.org strive to keep our archives well-maintained, but we're not perfect. We rely on our community of users to help catch miscategorized files, inappropriate material, or other issues, in order to keep our site as useful as it can be.

If you see anything about this file that you want to bring to the attention of a file archiver, please use the form below. In order to use this form, you must have a (free) ticalc.org account. You can also email filearchive@ticalc.org - be sure to include all details about the file. Thanks for the help, and we couldn't do this without you!