radix

Here is my RadixSort function (ascending): void RadixSort (int a[], int n) { int i, m=0, exp=1, b[MAX]; for (i=0; i<n; i++) { if (a[i]>m) m=a[i]; } while (m/exp>0) { int bucket[10]={0}; for (i=0; i<n; i++) bucket[a[i]/exp%10]++; for (i=1; i<10; i++) bucket[i]+=bucket[i-1]; for (i=n-1; i>=0; i--) b[--bucket[a[i]/exp%10]]=a[i]; for (i=0; i<n;i++){ a[i]=b[i]; } exp*=10; } } I'm try to change this to a descending sort by replacing for (i=0; i<n;i++) { a[i]=b[i]; } with for (i=0; i<n;i++) { a[i]=b[n-i-1]; } But it didn't work. I tried with: [705, 1725, 99, 9170, 7013] But the result is: [9170, 7013

I am browsing the SQL Server Management Studio Object Explorer: the metadata. Under the TempDb > Views > System Views > Columns object I find: "Numeric Precision Radix". I know what radix means (binary, decimal, hexidecimal, etc) and what Numeric Precision means (how many digits are in the representation of the number, and Scale: how many digits are after the radix point). But how can the metadata itself (Numeric Precision) have a Radix (system of encoding)? It is like saying what color is the CAN of paint? And why can't I find a description of this phrase anywhere? Thank you. I believe that

First of all this is homework , and I found another topic talking about the same subject but there was no answer. Here is the problem: Sorting by bit based on the assumption that the values ​​to be sorted are integers coded B bits (and therefore between 0 and 2B-1). The main problem is how to make this kind of sort. Should I convert each integer to bits and compare them? Please do not give me the solution just a hint or an explanation of how to do it. Thanks for your help ! [EDIT] I found this script in the internet but i did not understand how it works : #include <cstdlib> #include <iostream>

My program was not behaving correctly on one machine so I started to hunt for the bug, and I discovered that on that machine, snprintf uses a comma (,), not a . (dot) as 99% of other computers (at least in my experience). Shouldn't this be standardized? I am using a library that assumes that the radix is a . (dot) and so it does not work properly with a comma. So my question is, is there a simple way to force the dot as the radix character? I know I could just search & replace the comma by a dot manually, but surely there is a cleaner way. You should be able to change your locale-setting using

I'm attempting to implement a Patricia Trie with the methods addWord() , isWord() , and isPrefix() as a means to store a large dictionary of words for quick retrieval (including prefix search). I've read up on the concepts but they just aren't clarifying into an implementation. I want to know (in Java or Python code) how to implement the Trie, particularly the nodes (or should I implement it recursively). I saw one person who implemented it with an array of 26 child nodes set to null/None. Is there a better strategy (such as treating the letters as bits) and how would you implement it? Someone

I'm reading this but I'm confused by what is written in the parseInt with a radix argument chapter Why is it that parseInt(8, 3) → NaN and parseInt(16, 3) → 1 ? AFAIK 8 and 16 are not base-3 numbers, so parseInt(16, 3) should return NaN too T.J. Crowder This is something people trip over all the time, even when they know about it. :-) You're seeing this for the same reason parseInt("1abc") returns 1: parseInt stops at the first invalid character and returns whatever it has at that point. If there are no valid characters to parse, it returns NaN . parseInt(8, 3) means "parse "8" in base 3"

A couple of days ago I came across this CodeReview for Base-36 encoding a byte array. However, the answers that followed didn't touch on decoding back into a byte array, or possibly reusing the answer to perform encodings of different bases (radix). The answer for the linked question uses BigInteger. So as far as implementation goes, the base and its digits could be parametrized. The problem with BigInteger though, is that we're treating our input as an assumed integer. However, our input, a byte array, is just an opaque series of values. If the byte array ends in a series of zero bytes, eg

Can anyone explain how the parseInt() functions works and what the Radix Parameter is? As a case study, I am trying to get to grips with this code snippet: var maxChars = parseInt( formField.attr('maxlength') ? formField.attr('maxlength') : counter.text() ); Can you also explain how this code works? Why is formField.attr('maxlength') there twice? I find the use of operators here pretty darn confusing! How does the Radix Parameter work in this example? The radix is another name for base , i.e. 2 for binary, 10 for decimal, 16 for hexadecimal, explained in more detail on the Mozilla Developer

I am trying to implement radix sort for integers, including negative integers. For non-negative ints, I was planning to create a queue of 10 queues correspondingly for the digits 0-9 and implement the LSD algorithm. But I was kind of confused with negative integers. What I am thinking now, is to go ahead and create another queue of 10 queues for them and separately sort them and then at the end, I will gave 2 lists, one containing negative ints sorted and the other containing non-negative ints. And finally I would merge them. What do you think about this? Is there more efficient way to handle