Sort Array by Set Bit Count

Given an array of positive integers, your task is to sort the array in decreasing order based on the count of set bits in the binary representation of each integer.

If two numbers have the same number of set bits, maintain their original order.

Input:

T // number of test cases
N // size of the array
arr[] // array elements

Output:

Sorted array according to set bit count

Example:

Input:
1
3
2 4 3
Output:
3 2 4

Constraints:

1 ≤ T ≤ 50

1 ≤ N ≤ 10⁴

1 ≤ arr[i] ≤ 10⁹

Note:

You do not need to print anything, it has already been handled. Just modify the array in-place within the given function.

Question

Sort Array by Set Bit Count

Given an array of positive integers, your task is to sort the array in decreasing order based on the count of set bits in the binary representation of each integer.

If two numbers have the same number of set bits, maintain their original order.

Input:

T // number of test cases
N // size of the array
arr[] // array elements

Output:

Sorted array according to set bit count

Example:

Input:
1
3
2 4 3
Output:
3 2 4

Constraints:

1 ≤ T ≤ 50
1 ≤ N ≤ 10⁴
1 ≤ arr[i] ≤ 10⁹

Note:

You do not need to print anything, it has already been handled. Just modify the array in-place within the given function.

Accepted Answer

Sort the array in decreasing order based on the count of set bits in the binary representation of each integer.

Iterate through the array and calculate the set bit count for each integer using bitwise operations.
Use a custom comparator function to sort the array based on the set bit count.
Maintain the original order for integers with the same set bit count.
Modify the array in-place within the given function.