# Sort the numbers according to their product of digits

Given an array arr[] of N non-negative integers, the task is to sort these integers according to the product of their digits.

Examples:

Input: arr[] = {12, 10, 102, 31, 15}
Output: 10 102 12 31 15
10 -> 1 * 0 = 0
102 -> 1 * 0 * 2 = 0
12 -> 1 * 2 = 2
31 -> 3 * 1 = 3
15 -> 1 * 5 = 5

Input: arr[] = {12, 10}
Output: 10 12

## Recommended: Please try your approach on {IDE} first, before moving on to the solution.

Approach: The idea is to store each element with its product of digits in a vector pair and then sort all the elements of the vector according to the digit products stored. Finally, print the elements in order.

Below is the implementation of the above approach:

## C++

 `// C++ implementation of the approach ` `#include ` `using` `namespace` `std; ` ` `  `// Function to return the product ` `// of the digits of n ` `int` `productOfDigit(``int` `n) ` `{ ` `    ``int` `product = 1; ` `    ``while` `(n > 0) { ` `        ``product *= n % 10; ` `        ``n = n / 10; ` `    ``} ` `    ``return` `product; ` `} ` ` `  `// Function to sort the array according to ` `// the product of the digits of elements ` `void` `sortArr(``int` `arr[], ``int` `n) ` `{ ` `    ``// Vector to store the digit product ` `    ``// with respective elements ` `    ``vector > vp; ` ` `  `    ``// Inserting digit product with elements ` `    ``// in the vector pair ` `    ``for` `(``int` `i = 0; i < n; i++) { ` `        ``vp.push_back(make_pair(productOfDigit(arr[i]), arr[i])); ` `    ``} ` ` `  `    ``// Sort the vector, this will sort the pair ` `    ``// according to the product of the digits ` `    ``sort(vp.begin(), vp.end()); ` ` `  `    ``// Print the sorted vector content ` `    ``for` `(``int` `i = 0; i < vp.size(); i++) ` `        ``cout << vp[i].second << ``" "``; ` `} ` ` `  `// Driver code ` `int` `main() ` `{ ` `    ``int` `arr[] = { 12, 10, 102, 31, 15 }; ` `    ``int` `n = ``sizeof``(arr) / ``sizeof``(arr[0]); ` ` `  `    ``sortArr(arr, n); ` ` `  `    ``return` `0; ` `} `

## Python3

 `# Python3 implementation of the approach  ` ` `  `# Function to return the product  ` `# of the digits of n  ` `def` `productOfDigit(n) : ` ` `  `    ``product ``=` `1``;  ` `    ``while` `(n > ``0``) : ` `        ``product ``*``=` `(n ``%` `10``);  ` `        ``n ``=` `n ``/``/` `10``;  ` ` `  `    ``return` `product;  ` ` `  `# Function to sort the array according to  ` `# the product of the digits of elements  ` `def` `sortArr(arr, n) : ` `     `  `    ``# Vector to store the digit product  ` `    ``# with respective elements  ` `    ``vp ``=` `[];  ` ` `  `    ``# Inserting digit product with elements  ` `    ``# in the vector pair  ` `    ``for` `i ``in` `range``(n) : ` `        ``vp.append((productOfDigit(arr[i]), arr[i]));  ` `     `  `    ``# Sort the vector, this will sort the pair  ` `    ``# according to the product of the digits  ` `    ``vp.sort();  ` ` `  `    ``# Print the sorted vector content  ` `    ``for` `i ``in` `range``(``len``(vp)) : ` `        ``print``(vp[i][``1``], end ``=` `" "``);  ` ` `  `# Driver code  ` `if` `__name__ ``=``=` `"__main__"` `:  ` ` `  `    ``arr ``=` `[ ``12``, ``10``, ``102``, ``31``, ``15` `];  ` `    ``n ``=` `len``(arr);  ` ` `  `    ``sortArr(arr, n);  ` ` `  `# This code is contributed by AnkitRai01 `

Output:

```10 102 12 31 15
```

Time Complexity: O(nlogn)

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.

My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.

Improved By : AnkitRai01