algorithm - Recurrence relation of number of comparisons in binary search -


i have doubt recurrence relation number of comparisons in binary search.

i read recurrence can written t(n) = t(n/2) + 1 in website http://faculty.simpson.edu/lydia.sinapova/www/cmsc250/ln250_weiss/l14-recrel.htm

according me should t(n) = t(n/2) + 2, in worst case element might not present in array , end doing 2 comparisons in each pass.

please tell me whether right or wrong.

i think right.

imho, compare b means know a=b, a>b or a<b @ same time. say, 1 comparison may have 3 different results.

but programming languages. have use 2 comparisons.

if mid == x:      found it!          # 1st else if mid < x:  search right       # 2nd else:             search left

you mean == , < 2 comparisons.

it not affect result though. because use big o notation represent complexity. matter of constant, o don't care it.

according master theorem. either +1 or +2 result same complexity o(log n).

what want limit (big-o), not mathematical equation precise result.

i think matters here 1 , 2 both constant time. can split ==, > machine instructions, , may greater 2. or maybe programming languages or cpu utilize comparison, cost 1 comparison. not matter here when doing asymptotic analysis.

  1. https://en.wikipedia.org/wiki/master_theorem
  2. https://en.wikipedia.org/wiki/asymptotic_analysis

Comments

Post a Comment

Popular posts from this blog

android - InAppBilling registering BroadcastReceiver in AndroidManifest -

i'm implementing inapp billing in android app. works well, however, i'm trying decouple broadcast receiver activity manifest. suggestion in android's trivialdrive sample: // important: dynamically register broadcast messages updated purchases. // register receiver here instead of <receiver> in manifest // because call getpurchases() @ startup, therefore can ignore // broadcasts sent while app isn't running. // note: registering listener in activity bad idea, done here // because sample. regardless, receiver must registered after // iabhelper setup, before first call getpurchases(). currently there's class extends broadcastreceiver : public class iabbroadcastreceiver extends broadcastreceiver { /** * intent action receiver should filter for. */ public static final string action = "com.android.vending.billing.purchases_updated"; private final iabbroadcastlistener mlistener; public iabbroadcastreceiver(iabbroadcastlistener listener) { m...
Read more

python Tkinter Capturing keyboard events save as one single string -

is possible store keyboard events 1 string? code below stores 1 char , prints it. card reader or bar code reader, contains collection of character/ string not 1 character @ time. goal save char pressed text variable. from tkinter import * root = tk() def key(event): text= event.char text+= event.char print ("pressed", text) def callback(event): frame.focus_set() print ("clicked at", event.x, event.y) frame = frame(root, width=100, height=100) frame.bind("<key>", key) frame.bind("<button-1>", callback) frame.pack() root.mainloop() currently, creating text variable , everytime key() function gets called, , text stores last character typed. you can define text module level variable , , use module level text inside key function - text = '' def key(event): global text text+= event.char print("pressed", text)
Read more

sql server - Why does Linq-to-SQL add unnecessary COUNT()? -

here tables: create table customer ( cid int primary key, name varchar(32) ) create table ord ( oid int primary key, cid int foreign key references customer, address varchar(20) ) here's linq-to-sql statement: var aaa = c in db.customer select new { c, o = c.ord.tolist() }; and here's inexplicable query generated linq-to-sql: select [t0].[cid] [cid], [t0].[name] [name], [t1].[oid] [oid], [t1].[cid] [cid2], [t1].[address] [address], (select count(*) [dbo].[ord] [t2] [t2].[cid] = [t0].[cid]) [value] [dbo].[customer] [t0] left outer join [dbo].[ord] [t1] on [t1].[cid] = [t0].[cid] order [t0].[cid], [t1].[oid] i want understand how rid of count(*) part. it's entirely uncalled for! linq needs count(*) in order determine number of entries returned o = c.ord.tolist() .
Read more