Table of Contents
Understand concepts and illustrate with examples
algorithm
Example
Output
Using pointers and base addresses
Use vectors
Using the vector's back() function
in conclusion
Home Backend Development C++ C++ program to get the last element in an array

C++ program to get the last element in an array

Sep 05, 2023 pm 10:33 PM
C program to get the last element of an array C language programming: get the tail element of the array c programming to get the last element of the array

C++ program to get the last element in an array

Store multiple elements of the same type in a location where they can be accessed sequentially or in a way that allows sequential access. Arrays are one of the best options. In almost any computer language, arrays or related data structures can be used to store data. Arrays are linear data structures because basic operations such as insertion, deletion, traversal, and update take linear time to complete. Accessing array items is also simple. This article will demonstrate how to select the last element in a C array.

Understand concepts and illustrate with examples

Given array A = [10, 14, 65, 85, 96, 12, 35, 74, 69]
The last element is 69
Copy after login

For example, the last member can be accessed using the index position, as in the array given in the previous example. In C (and other programming languages ​​like Java and Python), array indexing starts at index 0. So, to read the last index, we just select the element from index (n − 1), where n is the element count of the array.

algorithm

  • Take an array A as input

  • n := The number of elements in A

  • last_element := Use A[ n – 1 ] to get

  • Return the last element

The Chinese translation of

Example

is:

Example

#include <iostream>
# define Z 50

using namespace std;

void displayArr(int arr[], int n){
   for( int i = 0; i < n; i++ ){
      cout << arr[ i ] << ", ";
   }
   cout << endl;
}

int pickLastElement( int A[], int n) {
   int last;
   last = A[ n - 1 ];
   return last;
}

int main() {
   int A[ Z ] = {57, 10, 14, 19, 86, 52, 32, 14, 76, 65, 32, 14};
   int n = 12;
   
   cout << "Given Array: ";
   displayArr( A, n );
   
   int last = pickLastElement( A, n ); 
   cout << "The last element of A: " << last << endl;
   
   int B[ Z ] = { 98, 12, 10, 23, 45, 74 };
   int m = 6;
   
   cout << "Another array: ";
   displayArr( B, m );
   
   last = pickLastElement( B, m ); 
   cout << "The last element of B: " << last << endl;
}
Copy after login

Output

Given Array: 57, 10, 14, 19, 86, 52, 32, 14, 76, 65, 32, 14, 
The last element of A: 14
Another array: 98, 12, 10, 23, 45, 74, 
The last element of B: 74
Copy after login
Copy after login
Copy after login
Copy after login

Using pointers and base addresses

The array is the location address of the base address (first) plus the offset (indices). Therefore, you can use pointers to access the index without using square brackets. To get the last element, you can use the base address value of the array. Let's look at the concrete implementation to get a clearer view.

The Chinese translation of

Example

is:

Example

#include <iostream>
# define Z 50

using namespace std;

void displayArr(int arr[], int n){
   for( int i = 0; i < n; i++ ){
      cout << arr[ i ] << ", ";
   }
   cout << endl;
}

int pickLastElement( int A[], int n) {
   int last;
   last = *(A + n - 1);
   return last;
}

int main() {
   int A[ Z ] = {57, 10, 14, 19, 86, 52, 32, 14, 76, 65, 32, 14};
   int n = 12;
   
   cout << "Given Array: ";
   displayArr( A, n );
   
   int last = pickLastElement( A, n ); 
   cout << "The last element of A: " << last << endl;
   
   int B[ Z ] = { 98, 12, 10, 23, 45, 74 };
   int m = 6;
   
   cout << "Another array: ";
   displayArr( B, m );
   
   last = pickLastElement( B, m ); 
   cout << "The last element of B: " << last << endl;
}
Copy after login

Output

Given Array: 57, 10, 14, 19, 86, 52, 32, 14, 76, 65, 32, 14, 
The last element of A: 14
Another array: 98, 12, 10, 23, 45, 74, 
The last element of B: 74
Copy after login
Copy after login
Copy after login
Copy after login

The value of A here (represented by pointer *A) represents the value of the address pointed to by A. This is the base address of the array.

Use vectors

Vectors are dynamic arrays, otherwise, the whole thing is array-like. Here, to read the last element, we only need to access the last index, which is vector.size() - 1. The code is as follows -

The Chinese translation of

Example

is:

Example

#include <iostream>
#include <vector>
# define Z 50

using namespace std;

void displayArr( vector<int> v ){
   for( int i = 0; i < v.size() ; i++ ){
      cout << v[ i ] << ", ";
   }
   cout << endl;
} 

int pickLastElement( vector<int> A) {
   int last;
   last = A[ A.size() - 1 ];
   return last;
}

int main() {
   vector<int> A = {57, 10, 14, 19, 86, 52, 32, 14, 76, 65, 32, 14};
   
   cout << "Given Array: ";
   displayArr( A );
   
   int last = pickLastElement( A ); 
   cout << "The last element of A: " << last << endl;
   
   vector<int> B = { 98, 12, 10, 23, 45, 74 };
   
   cout << "Another array: ";
   displayArr( B );
   
   last = pickLastElement( B ); 
   cout << "The last element of B: " << last << endl;
}
Copy after login

Output

Given Array: 57, 10, 14, 19, 86, 52, 32, 14, 76, 65, 32, 14, 
The last element of A: 14
Another array: 98, 12, 10, 23, 45, 74, 
The last element of B: 74
Copy after login
Copy after login
Copy after login
Copy after login

Using the vector's back() function

In the previous method we used index 0 to get the element, but there is another possible way. We can use the back() method to return the last element. Let's take a look at the code to get a clearer view.

The Chinese translation of

Example

is:

Example

#include <iostream>
#include <vector>
# define Z 50

using namespace std;

void displayArr( vector<int> v ){
   for( int i = 0; i < v.size() ; i++ ){
      cout << v[ i ] << ", ";
   }
   cout << endl;
} 

int pickLastElement( vector<int> A) {
   int last;
   last = A.back();
   return last;
}

int main() {
   vector<int> A = {57, 10, 14, 19, 86, 52, 32, 14, 76, 65, 32, 14};
   
   cout << "Given Array: ";
   displayArr( A );
   
   int last = pickLastElement( A ); 
   cout << "The last element of A: " << last << endl;
   
   vector<int> B = { 98, 12, 10, 23, 45, 74 };
   
   cout << "Another array: ";
   displayArr( B );
   
   last = pickLastElement( B ); 
   cout << "The last element of B: " << last << endl;
}
Copy after login

Output

Given Array: 57, 10, 14, 19, 86, 52, 32, 14, 76, 65, 32, 14, 
The last element of A: 14
Another array: 98, 12, 10, 23, 45, 74, 
The last element of B: 74
Copy after login
Copy after login
Copy after login
Copy after login

in conclusion

We have seen four different methods for reading the last element from an array. The first two methods are implemented based on static arrays in C. To read the last element, we just need to take the element from index 0. The same operation can be accomplished using the base address pointer of the array. The base address points to the first block, the value at that index will be the first element and by adding the offset we get the last element. In the next two methods, we use vectors. The approach here is the same as for static arrays. The last method uses the vector iterator's back() function, which returns the last element in the vector.

The above is the detailed content of C++ program to get the last element in an array. For more information, please follow other related articles on the PHP Chinese website!

Statement of this Website
The content of this article is voluntarily contributed by netizens, and the copyright belongs to the original author. This site does not assume corresponding legal responsibility. If you find any content suspected of plagiarism or infringement, please contact admin@php.cn

Hot AI Tools

Undresser.AI Undress

Undresser.AI Undress

AI-powered app for creating realistic nude photos

AI Clothes Remover

AI Clothes Remover

Online AI tool for removing clothes from photos.

Undress AI Tool

Undress AI Tool

Undress images for free

Clothoff.io

Clothoff.io

AI clothes remover

Video Face Swap

Video Face Swap

Swap faces in any video effortlessly with our completely free AI face swap tool!

Hot Tools

Notepad++7.3.1

Notepad++7.3.1

Easy-to-use and free code editor

SublimeText3 Chinese version

SublimeText3 Chinese version

Chinese version, very easy to use

Zend Studio 13.0.1

Zend Studio 13.0.1

Powerful PHP integrated development environment

Dreamweaver CS6

Dreamweaver CS6

Visual web development tools

SublimeText3 Mac version

SublimeText3 Mac version

God-level code editing software (SublimeText3)

C language data structure: data representation and operation of trees and graphs C language data structure: data representation and operation of trees and graphs Apr 04, 2025 am 11:18 AM

C language data structure: The data representation of the tree and graph is a hierarchical data structure consisting of nodes. Each node contains a data element and a pointer to its child nodes. The binary tree is a special type of tree. Each node has at most two child nodes. The data represents structTreeNode{intdata;structTreeNode*left;structTreeNode*right;}; Operation creates a tree traversal tree (predecision, in-order, and later order) search tree insertion node deletes node graph is a collection of data structures, where elements are vertices, and they can be connected together through edges with right or unrighted data representing neighbors.

The truth behind the C language file operation problem The truth behind the C language file operation problem Apr 04, 2025 am 11:24 AM

The truth about file operation problems: file opening failed: insufficient permissions, wrong paths, and file occupied. Data writing failed: the buffer is full, the file is not writable, and the disk space is insufficient. Other FAQs: slow file traversal, incorrect text file encoding, and binary file reading errors.

How to calculate c-subscript 3 subscript 5 c-subscript 3 subscript 5 algorithm tutorial How to calculate c-subscript 3 subscript 5 c-subscript 3 subscript 5 algorithm tutorial Apr 03, 2025 pm 10:33 PM

The calculation of C35 is essentially combinatorial mathematics, representing the number of combinations selected from 3 of 5 elements. The calculation formula is C53 = 5! / (3! * 2!), which can be directly calculated by loops to improve efficiency and avoid overflow. In addition, understanding the nature of combinations and mastering efficient calculation methods is crucial to solving many problems in the fields of probability statistics, cryptography, algorithm design, etc.

What are the basic requirements for c language functions What are the basic requirements for c language functions Apr 03, 2025 pm 10:06 PM

C language functions are the basis for code modularization and program building. They consist of declarations (function headers) and definitions (function bodies). C language uses values ​​to pass parameters by default, but external variables can also be modified using address pass. Functions can have or have no return value, and the return value type must be consistent with the declaration. Function naming should be clear and easy to understand, using camel or underscore nomenclature. Follow the single responsibility principle and keep the function simplicity to improve maintainability and readability.

Function name definition in c language Function name definition in c language Apr 03, 2025 pm 10:03 PM

The C language function name definition includes: return value type, function name, parameter list and function body. Function names should be clear, concise and unified in style to avoid conflicts with keywords. Function names have scopes and can be used after declaration. Function pointers allow functions to be passed or assigned as arguments. Common errors include naming conflicts, mismatch of parameter types, and undeclared functions. Performance optimization focuses on function design and implementation, while clear and easy-to-read code is crucial.

Concept of c language function Concept of c language function Apr 03, 2025 pm 10:09 PM

C language functions are reusable code blocks. They receive input, perform operations, and return results, which modularly improves reusability and reduces complexity. The internal mechanism of the function includes parameter passing, function execution, and return values. The entire process involves optimization such as function inline. A good function is written following the principle of single responsibility, small number of parameters, naming specifications, and error handling. Pointers combined with functions can achieve more powerful functions, such as modifying external variable values. Function pointers pass functions as parameters or store addresses, and are used to implement dynamic calls to functions. Understanding function features and techniques is the key to writing efficient, maintainable, and easy to understand C programs.

C language multithreaded programming: a beginner's guide and troubleshooting C language multithreaded programming: a beginner's guide and troubleshooting Apr 04, 2025 am 10:15 AM

C language multithreading programming guide: Creating threads: Use the pthread_create() function to specify thread ID, properties, and thread functions. Thread synchronization: Prevent data competition through mutexes, semaphores, and conditional variables. Practical case: Use multi-threading to calculate the Fibonacci number, assign tasks to multiple threads and synchronize the results. Troubleshooting: Solve problems such as program crashes, thread stop responses, and performance bottlenecks.

distinct function usage distance function c usage tutorial distinct function usage distance function c usage tutorial Apr 03, 2025 pm 10:27 PM

std::unique removes adjacent duplicate elements in the container and moves them to the end, returning an iterator pointing to the first duplicate element. std::distance calculates the distance between two iterators, that is, the number of elements they point to. These two functions are useful for optimizing code and improving efficiency, but there are also some pitfalls to be paid attention to, such as: std::unique only deals with adjacent duplicate elements. std::distance is less efficient when dealing with non-random access iterators. By mastering these features and best practices, you can fully utilize the power of these two functions.

See all articles