Question

I have a bunch of positive integers that need to be sorted by the number of zeros in it. For instance, 0 has 1 zero in it. 3001 has 2. Write a function called "sort_by_zeros" that takes in a vector of ints and returns a vector of ints sorted by their zero count. When two ints have the same count, preserve the original order. Note, you can only write one named function definition (i.e. sort_by_zeros) for this problem and you are not allowed allowed to use any looping or conditional constructs (no while, do-while, goto, for, or if statements).

Answer 1

//C++ program

#include<iostream>
#include<vector>
using namespace std;

int count_zero(int num){
   int count=0;
   while(num){
       if(num%10==0)count++;
       num/=10;
   }
   return count;
  
}

bool Greater(int a , int b){
   return count_zero(a)>count_zero(b);
}

void sort_by_zeros(vector<int>&vec){
   int n = vec.size();
   for(int i=n-1;i>=0;i--){
       for(int j=0;j<i;j++){
           if(Greater(vec[j],vec[j+1])){
               int temp=vec[j];
               vec[j]=vec[j+1];
               vec[j+1]=temp;
           }
       }
   }
}

int main(){
   vector<int >vec;
   vec.push_back(123);
   vec.push_back(0);
   vec.push_back(100001);
   vec.push_back(3001);
   vec.push_back(2001);
  
   for(int i=0;i<vec.size();i++){
       cout<<vec[i]<<" ";
   }
   cout<<"\n\nSorted Vector : \n";
   sort_by_zeros(vec);
   for(int i=0;i<vec.size();i++){
       cout<<vec[i]<<" ";
   }

return 0;
}

//sample output

CUsers\IshuManish\Documents countByZero.exe 1230 100001 3001 2001 Sorted Vector: 123 0 3001 2001 100001 Process exited after 0.1775 seconds with return value 0 Press any key to continue