You have given an array which contain 1 to n element, your task is to sort this array in an efficient way and without replace with 1 to n numbers.
Examples :
Input : arr[] = {10, 7, 9, 2, 8,
3, 5, 4, 6, 1};
Output : 1 2 3 4 5 6 7 8 9 10
Native approach :
Sort this array with the use of any type of sorting method. it takes O(nlogn) minimum time.
Efficient approach :
Replace every element with it’s position. it takes O(n) efficient time and give you the sorted array. Let’s understand this approach with the code below.
C++
// Efficient C++ program to sort an array of // numbers in range from 1 to n. #include <bits/stdc++.h> using namespace std; // function for sort array void sortit(int arr[], int n) { for (int i = 0; i < n; i++) { arr[i]=i+1; } } // Driver code int main() { int arr[] = { 10, 7, 9, 2, 8, 3, 5, 4, 6, 1 }; int n = sizeof(arr) / sizeof(arr[0]); // for sort an array sortit(arr, n); // for print all the element in sorted way for (int i = 0; i < n; i++) cout << arr[i] << " "; } |
chevron_right
filter_none
Java
// Efficient Java program to sort an // array of numbers in range from 1 // to n. import java.io.*; import java.util.*; public class GFG { // function for sort array static void sortit(int []arr, int n) { for (int i = 0; i < n; i++) { arr[i]=i+1; } } // Driver code public static void main(String args[]) { int []arr = {10, 7, 9, 2, 8, 3, 5, 4, 6, 1}; int n = arr.length; // for sort an array sortit(arr, n); // for print all the // element in sorted way for (int i = 0; i < n; i++) System.out.print(arr[i] + " "); } } // This code is contributed by Manish Shaw // (manishshaw1) |
chevron_right
filter_none
Python3
# Python3 program to sort an array of # numbers in range from 1 to n. # function for sort array def sortit(arr,n): for i in range(n): arr[i] = i+1 # Driver code if __name__=='__main__': arr = [10, 7, 9, 2, 8, 3, 5, 4, 6, 1 ] n = len(arr) # for sort an array sortit(arr,n) # for print all the element # in sorted way for i in range(n): print(arr[i],end=" ") # This code is contributed by # Shrikant13 |
chevron_right
filter_none
C#
// Efficient C# program to sort an array of // numbers in range from 1 to n. using System; using System.Collections.Generic; class GFG { // function for sort array static void sortit(int []arr, int n) { for (int i = 0; i < n; i++) { arr[i]=i+1; } } // Driver code public static void Main() { int []arr = {10, 7, 9, 2, 8, 3, 5, 4, 6, 1}; int n = arr.Length; // for sort an array sortit(arr, n); // for print all the // element in sorted way for (int i = 0; i < n; i++) Console.Write(arr[i] + " "); } } // This code is contributed by // Manish Shaw (manishshaw1) |
chevron_right
filter_none
PHP
<?php // Efficient PHP program to sort an // array of numbers in range from 1 to n. // function for sort array function sortit(&$arr, $n) { for ($i = 0; $i < $n; $i++) { $arr[$i]=$i+1; } } // Driver code $arr = array(10, 7, 9, 2, 8, 3, 5, 4, 6, 1); $n = count($arr); // for sort an array sortit($arr, $n); // for print all the // element in sorted way for ($i = 0; $i < $n; $i++) echo $arr[$i]." "; //This code is contributed by Manish Shaw //(manishshaw1) ?> |
chevron_right
filter_none
Output :
1 2 3 4 5 6 7 8 9 10
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.
Recommended Posts:
- Sort an Array which contain 1 to N values in O(N) using Cycle Sort
- Find a Symmetric matrix of order N that contain integers from 0 to N-1 and main diagonal should contain only 0's
- Sort first k values in ascending order and remaining n-k values in descending order
- Sort a String in decreasing order of values associated after removal of values smaller than X
- Count of numbers in a range that does not contain the digit M and which is divisible by M.
- Comparison among Bubble Sort, Selection Sort and Insertion Sort
- Maximize sum of array by reducing array elements to contain no triplets (i, j, k) where a[i] < a[j] and a[i] < a[k] and j <i < k
- Find duplicates in an Array with values 1 to N using counting sort
- Find minimum changes required in an array for it to contain k distinct elements
- Minimum capacity of small arrays needed to contain all element of the given array
- Bucket Sort To Sort an Array with Negative Numbers
- Program to sort an array of strings using Selection Sort
- Add elements in start to sort the array | Variation of Stalin Sort
- Ways to sort list of dictionaries by values in Python – Using itemgetter
- Sort Linked List containing values from 1 to N
- Store duplicate keys-values pair and sort the key-value pair by key
- Count of integers of length N and value less than K such that they contain digits only from the given set
- Maximum number of segments that can contain the given points
- Minimum length of square to contain at least half of the given Coordinates
- Count the nodes of a tree whose weighted string does not contain any duplicate characters
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.
