poojabi

hey this week my assignment is like this write functions for inserting and deleting elements for an ascending priority queue .implement as un unordered list and an ordered list. as usual our teacher told us to read about priority queue from any good book.i have very vague idea about priority …

between merge sort and binary insertion sort which is more efficient?i know that theoritically both are nlogn search bt practically which will be better.that means if we plot the graph of number of comparison vs number of element in the list hose slope wll be slightly more than the other.and …

It's from my homework assignment Question 1) Based on the O notation, approximately how many swaps and comparisons occur when Selection sort is called on a worst-case array of length 8? a) 16 b) 64 c) 100 d) 800 Number of swaps = O(n) which is "8" and Number of …

can any one give a slight hint about the alogirthm to evaluate a prefix expression using queue.i tried a lot bt now atthe dead end,

pls tell what is the difference between this two 1)taking a initger (or any fundamental data type) pointer in the main function and then send it to some funtion as parameter. int *p; function(p); 2)taking a intiger and sending its adress to any function. int p; function(&p); will both do …

i am given an assignment to write code on interpolation search binary search(searching an integer in an ordered list). bt i dont have a clear idea about about both of them as i missed the theory class.so can anyone suggest me from where i can get satisfying information about them?

i want to know the exact and correct definition of a linear list.should i mention about predesessor of every element too?or mentioning only one sucsessor for each element is enough to define a linear list.pls give an answear asap.i am really confused about it.