0
What else can I help you with?
8086 assembly program to sort a list of integers?
assembly language program for sorting an array using 8086 microprocessor.
A c program to call a function without using function name?
It can be done via its address, for example: void function (void (*callback)(void)) { (*callback)(); }
How do you find the area under a curved graph without using the limiting chord process?
The integral function of calculus is the method for determining the area under a curve. The limiting chord process is the "simple" math understanding required to learn the "complex" function of "integration". BTW: the derivative function is a "cousin" of the integral function which is used to determine the slope of curve at a given point.
How do you write an assembly language program to find the sum of n numbers using array?
write an assembly language program to find sum of N numbers
Algorithm of augment matrix a of order nn 1 stored using two dimensional array of size nn 1the solution of system of linear equation is stored in one dimensional array name x of size n?
Please use the discussion area to state your question in English.
How do you merge two array without using function?
Take another array big enough to hold both array copy content of these two array into new one. You merged two array and haven't used a single function.!
What is the time complexity of an algorithm that sorts an array of elements using a comparison-based sorting algorithm with a complexity of n log n?
The time complexity of sorting an array using a comparison-based sorting algorithm with a complexity of n log n is O(n log n).
How do you flip an array without using flip function in PHP?
Use a for-loop starting at the length of the array and go backwards and build up a new array with the values.
Is it possibly to return an array of strings in a function without using pointers in C plus plus?
No.
Using only one program implement bubble sorting insertion sorting quick sorting and selection sorting?
Its simple!dirve a menu based prog by using switch case & then apply every sorting function to it.
8086 assembly program to sort a list of integers?
assembly language program for sorting an array using 8086 microprocessor.
What is the definition of internal sorting?
Sorting that is accomplished entirely in memory without using disks or tapes for temporary files.
What is internal sorting with example?
Internal sorting refers to the process of sorting data that is entirely loaded into a computer's main memory (RAM). An example of internal sorting is using algorithms like QuickSort or MergeSort to arrange an array of integers stored in memory. Since all the data fits in RAM, these algorithms can operate efficiently without needing to access slower external storage. This is in contrast to external sorting, which involves sorting data that does not fit into memory and requires the use of disk-based storage.
How can you find factorial of each element in array using pointer?
To find the factorial of each element in an array using pointers in C, you can create a function that takes a pointer to the array and its size as parameters. In the function, iterate through the array using pointer arithmetic, calculating the factorial for each element and storing the result back in the same array or a separate array. For calculating the factorial, you can use a simple loop or recursion. Finally, print or return the modified array with the factorials.
How is an array name interpretedwhen it is passed to a function?
An array is still an array, regardless of how you pass it into functions. It is still an array-type variable at the beginning of a function. However, the function itself may manipulate the array by "imploding" it into a string with a delimiter, using array values with only specific keys, and such.
Is it possible to print matrix without using array?
Yes but why.
How do you work out the biggest number in an array without using the max function in Python 3?
To find the biggest number in an array without using the max function, you can initialize a variable to hold the largest number, typically starting with the first element of the array. Then, iterate through the array using a loop, and for each element, compare it with the current largest number. If the current element is greater, update the largest number. Finally, after the loop, the variable will contain the largest number in the array. Here’s a simple example: arr = [3, 5, 2, 9, 1] largest = arr[0] for num in arr: if num > largest: largest = num print(largest) # Output: 9
