Welcome to collectivesolver - Programming & Software Q&A with code examples. A website with trusted programming answers. All programs are tested and work.

Contact: aviboots(AT)netvision.net.il

Buy a domain name - Register cheap domain names from $0.99 - Namecheap

Scalable Hosting That Grows With You

Secure & Reliable Web Hosting, Free Domain, Free SSL, 1-Click WordPress Install, Expert 24/7 Support

Semrush - keyword research tool

Boost your online presence with premium web hosting and servers

Disclosure: My content contains affiliate links.

39,892 questions

51,823 answers

573 users

How to sort an array of 0s, 1s and 2s in C++

1 Answer

0 votes
#include <iostream>

void swap(int* a, int* b) {
    int tmp = *a;
    *a = *b;
    *b = tmp;
}

void sort012Array(int arr[], int size) {
    int lo = 0, curr = 0;
    int hi = size - 1;
    
    while (curr <= hi) {
        switch (arr[curr]) {
            case 0:
                swap(&arr[lo++], &arr[curr++]);
                break;
            case 1:
                curr++;
                break;
            case 2:
                swap(&arr[curr], &arr[hi--]);
                break;
        }
    }
}

int main()
{
    int arr[] = { 1, 2, 2, 0, 1, 1, 0, 2, 0, 1, 0, 0, 1 };

    int size = sizeof(arr) / sizeof(arr[0]);

    sort012Array(arr, size);

    for (int i = 0; i < size; i++)
        std::cout << arr[i] << " ";
}




/*
run:

0 0 0 0 0 1 1 1 1 1 2 2 2 

*/

 



answered Apr 18, 2023 by avibootz
edited Apr 19, 2023 by avibootz

Related questions

1 answer 105 views
105 views asked Apr 18, 2023 by avibootz
1 answer 104 views
1 answer 118 views
1 answer 124 views
1 answer 129 views
1 answer 129 views
2 answers 131 views
131 views asked Apr 19, 2023 by avibootz
...