answersLogoWhite

0


Best Answer

algorithm to convert a number representing radix r1 to radix r2

User Avatar

Wiki User

βˆ™ 11y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: Algorithm to convert a number representing radix r1 to r2?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

What is the running time of radix sort algorithm?

The running time of the radix sort algorithm is O(nk), where n is the number of elements to be sorted and k is the number of digits in the largest element.


Is radix sort an in-place sorting algorithm?

Yes, radix sort is an in-place sorting algorithm.


How many adders are required to realize a 256point radix-2 DIT-FFT algorithm?

i don’t know


Why is an excess-3 code is called an unweighted code?

here we can't convert to any radix system.only one way adding 3 creates decimal system. Later we need convert what we want, in remaining radix systems we have weight/radix which tells that to convert to particular system directly.


When is the modulus of a number equal to its radix?

The radix is a property of a numerical system, not an individual number. It is the number of different digits (or characters) used by the system to represent all numbers. Thus the radix of the binary system is 2: 0 and 1 the radix of the octal system is 8: 0,1,2,3,4,5,6 and 7 the radix of the decimal system is 10: 0,1,2,3,4,5,6,7,8 and 9 and so on. Since a number cannot have a radix, the question does not make sense.


What are the key differences between radix sort and quicksort in terms of efficiency and performance?

Radix sort and quicksort are both sorting algorithms, but they differ in their approach and efficiency. Radix sort is a non-comparative sorting algorithm that sorts numbers by their individual digits, making it efficient for sorting large numbers. Quicksort, on the other hand, is a comparative sorting algorithm that divides the list into smaller sublists based on a pivot element, making it efficient for sorting smaller lists. In terms of performance, radix sort has a time complexity of O(nk), where n is the number of elements and k is the number of digits, while quicksort has an average time complexity of O(n log n). Overall, radix sort is more efficient for sorting large numbers with a fixed number of digits, while quicksort is more efficient for general-purpose sorting.


What is a radix?

A radix is the number of distinct symbols used to represent numbers in a particular base.


What is the smallest 7-digit number?

1.000.000 (a million) is the smallest 7-digit number in radix 10 (decimal number). Here are some result of converted value form other bases : * Radix 2 : 26 = 128 * Radix 8 : 86 = 262.144 * Radix 16 : 166 = 16.777.216


What is radix in floating point representation?

In all number bases, the radix simply represents the point that separates the integer component from the fractional component in a real number. In decimal notation, the radix is more commonly called a decimal point.


The number system with a radix of 16?

The hexadecimal system.


What does the hexa number E78 in radix 7?

13541


What is a thamnophis radix?

there is no such thing as a thamnophis radix