Assembler is the best example of doing small project in C. It makes use of various standard functions which we generally do not use in assignments that we do in C.

Q.1) How Counting Sort works? Counting sort maintains a separate array to count occurrences of each element and stores them in another array as per their sorted position which is calculates on the basis of occurrences. For example, if the first element is 12 and if it occurs 5 times in the unsorted collection then first 5 positions in the array will be assigned to 12....and so on. Counting sort needs largest number (key) value in the collection to create counting array. For e

Q.1) Define Stack. Stack is an ordered collection of elements into which new element can be inserted or existing element can be deleted from one end called as the top of the stack. Stack is a Last-in-First-Out (LIFO) or First-In-Last-Out (FILO) structure. Q.2) What are the application of Stack? Q.3) "Stack can be considered as a priority queue.". Comment. Stack can be considered as an Ascending Priority Queue with minimal waiting time before popping an element as it is Last-I

Q.1) What is the process of merge sort? Merge sort takes two unsorted subarray and combine them into single sorted array. Q.2) What is the advantage of merge sort? Merge sort is faster in sorting elements as it avoids Swapping (interchanges). It does not require all elements in memory, hence it is best suitable for virtual memory environment. (refer to quick sort for more on virtual memory) Q.3) What is an efficiency of merge sort? Merge sort requires O(nlogn) comparisons irr

Q.1) What is the working of Quick Sort? Quick Sort method sorts one element at a time. The element selected for sorting called pivot element will be placed in array at its proper position such that to the left of it all elements are smaller or equal and to the right all elements are greater (in case of ascending sorting). An array will be divided into two parts at sorted position of the pivot and sorting continues with sub - arrays by selecting pivot element. Q.2) What is th

Q.1) What are the critical operations for Bubble Sort? Comparison and Swapping are two critical operations for sorting. Bubble sort requires both comparison and swapping , hence it is least efficient. Q.2) What is the basic idea of Bubble Sort ? (How it sorts?) The bubble sort passes through the file(or array) sequentially several times. Each pass consists of comparing each element in the file with its successor (x[i] with x[i+1]) and interchanging the two elements if they

Program to sort and search integers using C, C++ and JAVA

Program to search any integer key using Binary Search Method in C, C++ and JAVA

Please Note : Following all three versions of program included function for checking parenthesis of expressions. The function has sequence of if ...else statements purposefully implemented to make the logic easy to understand. Reader's are encouraged to use other alternatives such as switch...case to experiment with this code.

Sequential Search with Insertion Sort Using C, C++, and JAVA

Sequential Search Using C, C++ and JAVA

Sequential Search ( Linear Search ) Method - Using C , C++, JAVA

C is a an oldest programming language used by system developers for developing complex software such as an operating system. It is a...