java - Feedback on my Binary Search Algorithm -

-

i have written binary search algorithm, seems bit different other peoples i've seen. hoping community give me feedback whether or not i'm missing something, or doing wrong way.

binary search: 

import java.util.arrays;   public class binarysearch {      public int[] numbers = new int[] {1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20};       /**      * @param num      * @param key      *       * function recursively searches sorted array of integers, finding specific number (key).      * search looks @ midpoint of array, checking see if midpoint number being sought,      * if not, depending of whether sought number greater than, or less than, midpoint      * function copies upper, or lower, half of array , passes recursive       * function call.      *       */     public int performsearch(int[] num, int key){         if(num.length == 0){             system.out.println("array empty");              return 0;          }else{             int mid;              int number=0;              mid = (num.length)/2;              if(key == num[mid]){                 number =  num[mid];                  system.out.println("found number " + number);                  return number;              }else if((key < num[mid]) && num.length > 1){                 num = arrays.copyofrange(num, 0, mid);                  system.out.println("low range: " + arrays.tostring(num));                  return performsearch(num, key);              }else if((key > num[mid]) && num.length > 1){                 num = arrays.copyofrange(num, mid, num.length);                  system.out.println("high range: " + arrays.tostring(num));                  return performsearch(num, key);              }else{                 system.out.println("number not exist in array.");                  return 0;              }             //return number;          }      }      /**      * @param args      */     public static void main(string[] args) {         int key = 22;          binarysearch bs = new binarysearch();          int index = bs.performsearch(bs.numbers, key);          system.out.println("number " + index);     }  }

this implementation inefficient. problem line:

num = arrays.copyofrange(num, 0, mid);

it creating copy of array, takes long time.


Comments

Post a Comment

Popular posts from this blog

Perl - how to grep a block of text from a file -

-
it can in xml or text format. how in general grep block of text in perl? <track type="ws"> <range> <rangestart>0</rangestart> <rangeend>146.912</rangeend> <locationindex>0</locationindex> <propertyindex>0</propertyindex> </range> </track> <track type="ps" id="1"> <range> <rangestart>0</rangestart> <rangeend>146.912</rangeend> <locationindex>1</locationindex> <propertyindex>1</propertyindex> </range> </track> i want grep type="ps" , till </range> . one solution open file, read line line , match block. open(fh, "file.txt"); foreach $line (<fh>) { if ($line =~ m/type="cc"(.*?)<\/range>/) { print $1; } } but there more optimal solution without reading file line l
Read more

delphi - How to remove all the grips on a coolbar if I have several coolbands? -

-
Image
if set mycoolbar.fixedorder true,only grip on first band hidden. well,if use delphi 7 create vcl forms application,then put coolbar on , create 3 coolbans hold other controls,only grip , top coolbands can hidden setting mycoolbar.fixedorder:=true. i've uploaded picture make things clear. you got fixedorder property wrong. fixed property not allow bands rearranged if set true . setting property of coolbar true keep user changing bands order @ runtime, user can still move , resize bands. can give advice can do, actual solution problem, well, have wait answer. my advice use 3 coolbars in row , setting "fixedorder" property true , bandborderstyle bsnone . way grip hidden on of them. about property, it's not bug of ide, actual preference of property.
Read more

javascript - Animating array of divs; only the final element is modified -

-
this baffling me @ moment. i'm experienced programmer looking throw bit of surprise fiancee on countdown page our wedding. desired effect simulated confetti falling behind main page. setup follows: i have array of divs in javascript. each div absolutely positioned on page. have interval set updates every 50 or milliseconds. on each tick, run loop on array of divs, , calculations , update positions. problem problem having, however, though can see divs created, stored array, , modified (in case, each has slight randomized rotation) during initialization phase, once tick update position starts, div stored in whatever last slot of array gets position updated. tried hard-coding each div index testing purposes, strictly last element update position. upon printing current "left" , "top" style values each div before , after calculations shows value has been changed, no visible change noticeable. here's basic code: javascript var container;
Read more