Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid
 
PerlMonks  

Re: Binary search

by akvats01 (Initiate)
on Mar 29, 2013 at 16:50 UTC ( #1026171=note: print w/ replies, xml ) Need Help??


in reply to Binary search

Thanks to everybody. my apologies that code was not readable smoothly. This was my first post, I will take care next post onwards. to sort the list , I have used

@num_list1= (34,2,65,345,987,23,12,45,62,100); @num_list= sort {a <=> b} @num_list1;
Still I am seeing the same results. I am due to read the algo implementation as mentioned above. meanwhile I will be thankful, if some light can be thrown on , why the code is working partially. What should I keep in mind : Not to entre in such a situation again where code is working partially. Thanks!!


Comment on Re: Binary search
Download Code
Re^2: Binary search
by akvats01 (Initiate) on Mar 29, 2013 at 17:04 UTC

    Thanks to everyone. I have sorted the array as follows

    @num_list1=(34,2,65,345,987,23,12,45,62,100); @num_list= sort {a <=> b} @num_list1;
    Still the same results are shown. I am due to go through the algorithm implementation mentioned above. Meanwhile, I will be thankful if some light may be thrown on why the code is working partially? what precautions should I take to avoid this situation when code is working partially. Thanks.

    My apologies for code not being readable. The original code, after implementing sort is :

    #!/usr/bin/perl @num_list1=(34,2,65,345,987,23,12,45,62,100); @num_list= sort {a <=> b} @num_list1; $low=0; $found_key=0; $index; $high=$#num_list; print "enter the key: \t"; chomp($key=<STDIN>); while($high>=$low && !$found_key) { $mid=($low+$high)/2; if ($key == @num_list[$mid]) { $found_key=1; $index = int($mid); } if ($key > @num_list[$mid]) { $low = $mid+1; } if ($key < @num_list[$mid]) { $high = $mid-1; } } if ($found_key) { print " The key is $index\n"; } else {print "key is not found";}
      Hi akvats01,

      Did you try printing out the sorted list to make sure it got sorted correctly?

      I did, and got:

      print "Sorted => @num_list\n"; # Output: Sorted => 34 2 65 345 987 23 12 45 62 100

      So the sort isn't working. Now that I know that's a problem, I look at your sort line more carefully:

      @num_list= sort {a <=> b} @num_list1;
      And it's obvious what's wrong; you should use "$a" and "$b". You would have found that if you used the "strict" and "warnings" pragmas. Try running this partial program and you'll see:
      #!/usr/bin/perl use strict; use warnings; my @num_list1=(34,2,65,345,987,23,12,45,62,100); my @num_list= sort {a <=> b} @num_list1; print "Sorted: @num_list\n"; # Output: # # Bareword "a" not allowed while "strict subs" in use at 1026159.pl li +ne 7. # Bareword "b" not allowed while "strict subs" in use at 1026159.pl li +ne 7. # Execution of 1026159.pl aborted due to compilation errors.
      The other (potential) problem I can see is that you are not doing integer math, so when you take the average of $low and $high with:
      $mid = ($low+$high)/2;
      you're sometimes getting a fractional result. You may need to use int to fix that.

      Try those fixes to start with and see if you can get farther. One other recommendation would be to put print statements at various locations in your code to make sure you're getting the expected results each time through the loop.

      say  substr+lc crypt(qw $i3 SI$),4,5

      This line will produce a non-integer value with an odd number of elements, which can't be an index of an array.

      $mid=($low+$high)/2;
      If you use the following at the top of your scripts and make the necessary corrections for it to compile, it will make your life easier and your code better.
      use strict; use warnings;

      Update: I see now that an array can be indexed with a non-integer value, effectively truncating the fractional part. I'm surprised that gives no warning.

      use strict; use warnings; use feature 'say'; my @list = 0..9; say $list[2.5]; say $list[2.01]; say $list[2.99]; # all these print '2'
      golux is correct of course about the sort, which is something that enabling 'strict' and 'warnings' would pick up.

Re^2: Binary search
by roboticus (Canon) on Mar 29, 2013 at 19:41 UTC

    akvats01:

    @num_list= sort {$a <=> $b} @num_list1;

    would work better.... ;^)

    ...roboticus

    When your only tool is a hammer, all problems look like your thumb.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1026171]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others chilling in the Monastery: (9)
As of 2014-07-31 04:35 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite superfluous repetitious redundant duplicative phrase is:









    Results (244 votes), past polls