Go To Problems

☰

Level 2

Arrays

TUTORIAL

1. Introduction To Pointers In C/C++

2. Arrays In Programming Fundamentals

3. Pointers And Arrays

4. Pointers And 2 D Arrays

5. Array Implementation Details

6. Sorting Algorithms

7. Insertion Sort Algorithm

8. Merge Sort Algorithm

9. Quick Sort Algorithm

10. Sort Implementation Details

11. Selection Sort

12. Bubble Sort

Sort Implementation Details

C :

sorting integer array A with size sz,

    // You will have to implement a compareFunction. Example shown below. 
    qsort(A, sz, sizeof(int), compareFunction);
    
    // Example of compare function 
    int compareFunction(const void* a, const void* b) {
        int value1 = *((int *)a);
        int value2 = *((int *)b);
        if (value1 < value2) {
            // Return -1 if you want ascending. 1 if you want descending. 
            return -1;
        } else if (value1 > value2) {
            // Return 1 if you want ascending. -1 if you want descending. 
            return 1;
        }
        return 0;
    }

C++

Sorting vector V,

    sort(V.begin(), V.end());

JAVA

    ArrayList<Integer> A = .... 
    Collections.sort(A);

PYTHON :

    l = [...]
    l.sort()

Welcome to Interviewbit, help us create the best experience for you!

Few details about your education

Few details about your education

Few details about your career...

You're all set!

Begin your success journey!

Welcome back!

Level 2

Arrays

Sort Implementation Details

C :

sorting integer array A with size sz,

C++

Sorting vector V,

JAVA

PYTHON :