برنامه معکوس کردن رشته و آرایه — به زبان ساده

1// Iterative C++ program to reverse an array 
2#include <bits/stdc++.h> 
3using namespace std; 
4  
5/* Function to reverse arr[] from start to end*/
6void rvereseArray(int arr[], int start, int end) 
7{ 
8    while (start < end) 
9    { 
10        int temp = arr[start];  
11        arr[start] = arr[end]; 
12        arr[end] = temp; 
13        start++; 
14        end--; 
15    }  
16}      
17  
18/* Utility function to print an array */
19void printArray(int arr[], int size) 
20{ 
21   for (int i = 0; i < size; i++) 
22   cout << arr[i] << " "; 
23  
24   cout << endl; 
25}  
26  
27/* Driver function to test above functions */
28int main()  
29{ 
30    int arr[] = {1, 2, 3, 4, 5, 6}; 
31      
32    int n = sizeof(arr) / sizeof(arr[0]);  
33  
34    // To print original array  
35    printArray(arr, n); 
36      
37    // Function calling 
38    rvereseArray(arr, 0, n-1); 
39      
40    cout << "Reversed array is" << endl; 
41      
42    // To print the Reversed array 
43    printArray(arr, n); 
44      
45    return 0; 
46}

1// Iterative C program to reverse an array 
2#include<stdio.h> 
3  
4/* Function to reverse arr[] from start to end*/
5void rvereseArray(int arr[], int start, int end) 
6{ 
7    int temp; 
8    while (start < end) 
9    { 
10        temp = arr[start];    
11        arr[start] = arr[end]; 
12        arr[end] = temp; 
13        start++; 
14        end--; 
15    }    
16}      
17  
18/* Utility that prints out an array on a line */
19void printArray(int arr[], int size) 
20{ 
21  int i; 
22  for (i=0; i < size; i++) 
23    printf("%d ", arr[i]); 
24  
25  printf("\n"); 
26}  
27  
28/* Driver function to test above functions */
29int main()  
30{ 
31    int arr[] = {1, 2, 3, 4, 5, 6}; 
32    int n = sizeof(arr) / sizeof(arr[0]);  
33    printArray(arr, n); 
34    rvereseArray(arr, 0, n-1); 
35    printf("Reversed array is \n"); 
36    printArray(arr, n);     
37    return 0; 
38}

1// Iterative java program to reverse an 
2// array 
3public class GFG { 
4      
5   /* Function to reverse arr[] from  
6    start to end*/
7    static void rvereseArray(int arr[], 
8                    int start, int end) 
9    { 
10        int temp; 
11           
12        while (start < end) 
13        { 
14            temp = arr[start];  
15            arr[start] = arr[end]; 
16            arr[end] = temp; 
17            start++; 
18            end--; 
19        }  
20    }      
21       
22    /* Utility that prints out an 
23    array on a line */
24    static void printArray(int arr[],  
25                            int size) 
26    { 
27        for (int i = 0; i < size; i++) 
28             System.out.print(arr[i] + " "); 
29           
30         System.out.println(); 
31    }  
32  
33    // Driver code 
34    public static void main(String args[]) { 
35          
36        int arr[] = {1, 2, 3, 4, 5, 6}; 
37        printArray(arr, 6); 
38        rvereseArray(arr, 0, 5); 
39        System.out.print("Reversed array is \n"); 
40        printArray(arr, 6);  
41         
42    } 
43} 
44  
45// This code is contributed by Sam007

1# Iterative python program to reverse an array 
2  
3# Function to reverse A[] from start to end 
4def reverseList(A, start, end): 
5    while start < end: 
6        A[start], A[end] = A[end], A[start] 
7        start += 1
8        end -= 1
9  
10# Driver function to test above function 
11A = [1, 2, 3, 4, 5, 6] 
12print(A) 
13reverseList(A, 0, 5) 
14print("Reversed list is") 
15print(A) 
16# This program is contributed by Pratik Chhajer

1// Iterative C# program to reverse an 
2// array 
3using System; 
4  
5class GFG { 
6  
7    /* Function to reverse arr[] from  
8    start to end*/
9    static void rvereseArray(int []arr, 
10                    int start, int end) 
11    { 
12        int temp; 
13          
14        while (start < end) 
15        { 
16            temp = arr[start];  
17            arr[start] = arr[end]; 
18            arr[end] = temp; 
19            start++; 
20            end--; 
21        }  
22    }      
23      
24    /* Utility that prints out an 
25    array on a line */
26    static void printArray(int []arr,  
27                            int size) 
28    { 
29        for (int i = 0; i < size; i++) 
30            Console.Write(arr[i] + " "); 
31          
32        Console.WriteLine(); 
33    }  
34      
35    // Driver function 
36    public static void Main() 
37    { 
38        int []arr = {1, 2, 3, 4, 5, 6}; 
39        printArray(arr, 6); 
40        rvereseArray(arr, 0, 5); 
41        Console.Write("Reversed array is \n"); 
42        printArray(arr, 6);  
43    } 
44} 
45  
46// This code is contributed by Sam007

1<?php  
2// Iterative PHP program  
3// to reverse an array 
4  
5/* Function to reverse  
6$arr from start to end*/
7function rvereseArray(&$arr, $start,  
8                       $end) 
9{ 
10    while ($start < $end) 
11    { 
12        $temp = $arr[$start];  
13        $arr[$start] = $arr[$end]; 
14        $arr[$end] = $temp; 
15        $start++; 
16        $end--; 
17    }  
18}      
19  
20/* Utility function to  
21   print an array */
22function printArray(&$arr, $size) 
23{ 
24for ($i = 0; $i < $size; $i++) 
25echo $arr[$i] . " "; 
26  
27echo "\n"; 
28}  
29  
30// Driver code 
31$arr = array(1, 2, 3, 4, 5, 6); 
32  
33// To print original array 
34printArray($arr, 6); 
35  
36// Function calling 
37rvereseArray($arr, 0, 5); 
38  
39echo "Reversed array is" ."\n"; 
40  
41// To print the Reversed array 
42printArray($arr, 6); 
43  
44// This code is contributed 
45// by ChitraNayal 
46?>

1// Recursive C++ program to reverse an array 
2#include <bits/stdc++.h> 
3using namespace std; 
4  
5/* Function to reverse arr[] from start to end*/
6void rvereseArray(int arr[], int start, int end) 
7{ 
8    if (start >= end) 
9    return; 
10      
11    int temp = arr[start];  
12    arr[start] = arr[end]; 
13    arr[end] = temp; 
14      
15    // Recursive Function calling 
16    rvereseArray(arr, start + 1, end - 1);  
17}      
18  
19  
20/* Utility function to print an array */
21void printArray(int arr[], int size) 
22{ 
23   for (int i = 0; i < size; i++) 
24   cout << arr[i] << " "; 
25  
26   cout << endl; 
27}  
28  
29/* Driver function to test above functions */
30int main()  
31{ 
32    int arr[] = {1, 2, 3, 4, 5, 6}; 
33      
34    // To print original array 
35    printArray(arr, 6); 
36      
37    // Function calling 
38    rvereseArray(arr, 0, 5); 
39      
40    cout << "Reversed array is" << endl; 
41      
42    // To print the Reversed array 
43    printArray(arr, 6); 
44      
45    return 0; 
46}

1// Recursive C program to reverse an array 
2#include <stdio.h> 
3  
4/* Function to reverse arr[] from start to end*/
5void rvereseArray(int arr[], int start, int end) 
6{ 
7   int temp; 
8   if (start >= end) 
9     return; 
10   temp = arr[start];    
11   arr[start] = arr[end]; 
12   arr[end] = temp; 
13   rvereseArray(arr, start+1, end-1);    
14}      
15  
16/* Utility that prints out an array on a line */
17void printArray(int arr[], int size) 
18{ 
19  int i; 
20  for (i=0; i < size; i++) 
21    printf("%d ", arr[i]); 
22  
23  printf("\n"); 
24}  
25  
26/* Driver function to test above functions */
27int main()  
28{ 
29    int arr[] = {1, 2, 3, 4, 5, 6}; 
30    printArray(arr, 6); 
31    rvereseArray(arr, 0, 5); 
32    printf("Reversed array is \n"); 
33    printArray(arr, 6);     
34    return 0; 
35}

1// Recursive Java Program to reverse an array 
2import java.io.*; 
3  
4class ReverseArray { 
5  
6    /* Function to reverse arr[] from start to end*/
7    static void rvereseArray(int arr[], int start, int end) 
8    { 
9        int temp; 
10        if (start >= end) 
11            return; 
12        temp = arr[start]; 
13        arr[start] = arr[end]; 
14        arr[end] = temp; 
15        rvereseArray(arr, start+1, end-1); 
16    } 
17  
18    /* Utility that prints out an array on a line */
19    static void printArray(int arr[], int size) 
20    { 
21        for (int i=0; i < size; i++) 
22            System.out.print(arr[i] + " "); 
23        System.out.println(""); 
24    } 
25  
26    /*Driver function to check for above functions*/
27    public static void main (String[] args) { 
28        int arr[] = {1, 2, 3, 4, 5, 6}; 
29        printArray(arr, 6); 
30        rvereseArray(arr, 0, 5); 
31        System.out.println("Reversed array is "); 
32        printArray(arr, 6); 
33    } 
34} 
35/*This article is contributed by Devesh Agrawal*/

1# Recursive python program to reverse an array 
2  
3# Function to reverse A[] from start to end 
4def reverseList(A, start, end): 
5    if start >= end: 
6        return
7    A[start], A[end] = A[end], A[start] 
8    reverseList(A, start+1, end-1) 
9  
10# Driver function to test above function 
11A = [1, 2, 3, 4, 5, 6] 
12print(A) 
13reverseList(A, 0, 5) 
14print("Reversed list is") 
15print(A) 
16# This program is contributed by Pratik Chhajer