 Related Questions The answer depends on what you mean by quickest. For most sorting problems, it just doesn’t matter how quick the sort is because it is done infrequently or other operations take significantly more Latest Answer : The algorithms which follows divide and qunquer technique provides fastest implementation. ... A binary search, such as bsearch() performs, is much faster than a linear search. A hashing algorithm can provide even faster searching. One particularly interesting and fast method for searching is to Latest Answer : quick short method is a best one ... To hash means to grind up, and that’s essentially what hashing is all about. The heart of a hashing algorithm is a hash function that takes your nice, neat data and grinds it into some random-looking Latest Answer : hash is actually using a maping function to map the items to keys, if two different items map to one key, a collision solution is needed. ... Both the merge sort and the radix sort are good sorting algorithms to use for linked lists. Latest Answer : For this no need to write sepate function. We can arrage the elements in order by using some comaprisons in creation of list.venkatesh_ch@fastmail.fm ... Unfortunately, the only way to search a linked list is with a linear search, because the only way a linked list’s members can be accessed is sequentially. Sometimes it is quicker to take the data Latest Answer : hai here am writing a simple ex for searchina linked list for specific valuestruct link{int data;struct link *node;}if the above struct is a node such that in a node u can store a data and pointer to the next node.if u have the pointer the beginning of ... The stack is where all the functions’ local (auto) variables are created. The stack also contains some information used to call and return from functions. A “stack trace” is a list of Latest Answer : Please tell me, how I can extract stack information(runtime) of the code being executed using C. The program is running on Windows machine. ... The heap is where malloc(), calloc(), and realloc() get memory. Getting memory from the heap is much slower than getting it from the stack. On the other hand, the heap is much more flexible than the stack. Latest Answer : Heap is a dynamic memory of main memory. In main memory there are several type of memory management like fixed, static, dynamic (it is just memory area which can be used by any task or process but it is not
contiguous memory location). Now the point ... What is a “null pointer assignment” error? What are bus errors, memory faults, and core dumps? These are all serious errors, symptoms of a wild pointer or subscript. Null pointer assignment is a message you might get when an MS-DOS program finishes executing. Some such programs can arrange for Tags : Pointer Latest Answer : Hi,I agree with Ashtosh , since linked list nodes are stored dynamically in memory wherever it has space so the simple addition wont give track of nodes but a junk value.we can construct this only by combining two pointer nodes for single data value.its ... Tags : Pointer The questions are as follows: 1. Write a 'c' program to read the age of 100 persons and count the number of persons in the age group 50 to 60.use for loop and continue statements.(10 marks)2. Write a program to read a positive integer and print its binary equivalent.(10 marks)3. Given two one dimensional arrays a and b which are sorted in ascending order. write a program to merge them into a single sorted array ,c that contains every item from arrays a and b, in ascending order.(10 marks)4. Read Answers (11) | Asked by : Arka chakraborty
Sponsored Links
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
