kisi2 soal pemrograman :

1. konsep algoritma, computational thinking, struktur data, program

- Konsep algoritma : Metode atau langkah – langkah yang struktur pada suatu program (bisa
dibilang kayak alur berpikir)
- Computational Thinking : Cara berpikir komputer untuk menyelsaikan masalah.
- Struktur data : Cara mengatur data atau mengelompokkan data untuk langkah
memprogram suatu sistem/program
- Program : Coding atau program yang akan dibuat.
2. membuat algoritma, flow chart, ada perulangan ada modulu ada pembagian serta konversi A
= 65
Jawaban :
- Algoritma
• START
• Menginialisasi Variable A dengan nilai 65
• Menginialisasi hasil dengan nilai 0
• Memulai perulangan :
I. IF (A != 0; B++)
IF (A == 0)
II. Hasil = Hasil + (a%10)
III. A = A/10
IV. Mengulang kembali
• END

Gambar Flowchart seperti biasa

3. membuat program yg memerlukan perulangan (mengecek prima)

Jawaban :
#include<iostream>
using namespace std;

int main(){
int bil;
bool prima = true;

cout<<"Masukkan angka: ";

cin>>bil;

// Periksa jika bil kurang dari 2, bil bukan prima

if (bil<2){
prima = false;
}

// Jika bilangan 2 atau lebih besar

else {
// lakukan iterasi untuk memeriksa apakah bil habis dibagi 2 sampai bil/2
for(int i=2; i<=bil/2; i++){
if(bil%i==0){
prima=false;
 break;
}
}
}

return 0;
}

4. array sederhana, melihat tren data array. dimensi 1 integer. n selalu dari 0
Jawaban :
#include <iostream>
using namespace std;

int main() {
int n;
cout<<"Masukkan jumlah bilangan: ";
cin>>n;

int arr[n];

cout<<"\nMasukkan isi array:\n";

for(int i=0;i<n;i++){
cin>>arr[i];
}

cout<<"\nArray: ";
for(int i=0;i<n;i++){
cout<<arr[i]<<" ";
}

cout<<"\nTerbalik: ";
for(int i=n-1;i>=0;i--){
cout<<arr[i]<<" ";
}

// mengurutkan array ascending

int temp; // variabel temp akan dipakai untuk menyimpan nilai elemen
for (int i = 0; i < n; i++){
for (int j = i+1; j < n; j++){
if (arr[i] > arr[j]){
temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
}

cout<<"\nAscending: ";
 for(int i=0;i<n;i++){
cout<<arr[i]<<" ";
}

// mengurutkan array descending

for (int i = 0; i < n; i++){
for (int j = i+1; j < n; j++){
if (arr[i] < arr[j]){
temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
}

cout<<"\nDescending: ";
for(int i=0;i<n;i++){
cout<<arr[i]<<" ";
}

return 0;
}

5. array juga tapi lebih kompleks. sirkular array. bisa pake while atau for
Jawaban :
Jawaban :

#include<iostream>
using namespace std;

int main(){
int jumlah_data;
cin>>jumlah_data;

//input
int data[jumlah_data];
for (int a = 0; a<jumlah_data; a++){
cin>>data[a];
}

//menentukan nilai tertinggi

int output = 0;
int tertinggi = data[0];
for (int b = 0; b<jumlah_data; b++){
if (tertinggi <= data[b]){
tertinggi = data[b];
}
}
//menentukan jumlah dari nilai tertinggi
for (int c = 0; c<jumlah_data; c++){
if (data[c]==tertinggi){
output++;
 }
}

//cout<<tertinggi<<endl;
cout<<output;
}
#include <iostream> #include <iostream>
using namespace std; using namespace std;

int main() { int main() {

int n; int data[] = {4, 2, 6, 7, 4, 3, 9, 4, 6, 4, 9, 1, 2,
cout<<"Masukkan jumlah bilangan: "; 4}; // Sample data array
cin>>n; int length = sizeof(data) / sizeof(data[0]); //
Calculate the length of the array
int arr[n]; int bil = 4; // The value we want to search for

cout<<"\nMasukkan isi array:\n"; int jumlah = 0; // Initialize a counter for

for(int i=0;i<n;i++){ occurrences
cin>>arr[i]; int total = 0; // Initialize a total accumulator
}
// Loop through the array
cout<<"\nArray: "; for (int i = 0; i < length; i++) {
for(int i=0;i<n;i++){ if (data[i] == bil) {
cout<<arr[i]<<" "; jumlah++; // Increment the counter for
} each occurrence
total += data[i]; // Add the value to the
cout<<"\nTerbalik: "; total
for(int i=n-1;i>=0;i--){ }
cout<<arr[i]<<" "; }
}
// Check if the value was found at least once
// mengurutkan array ascending cout << "Kemunculan angka " << bil << ": " <<
int temp; // variabel temp akan dipakai untuk jumlah << " kali" << endl;
menyimpan nilai elemen cout << "Total: " << total << endl;
for (int i = 0; i < n; i++){
for (int j = i+1; j < n; j++){ return 0;
if (arr[i] > arr[j]){ }
temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
}

cout<<"\nAscending: ";
for(int i=0;i<n;i++){
cout<<arr[i]<<" ";
}

// mengurutkan array descending

for (int i = 0; i < n; i++){
for (int j = i+1; j < n; j++){
if (arr[i] < arr[j]){
temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
 }
}

cout<<"\nDescending: ";
for(int i=0;i<n;i++){
cout<<arr[i]<<" ";
}

return 0;
}

#include <iostream> #include<iostream>

using namespace std;
using namespace std;
int main(){
int main() { int n;
char operasi; cout<<"Masukkan n: ";
double angka1, angka2; cin>>n;

// Meminta pengguna memasukkan operator cout<<n;

cout << "Masukkan operator (+ atau -): ";
cin >> operasi; if (0<n<=80){
if (n<=5) cout<<"toddler";
// Meminta pengguna memasukkan dua else if (n<=17) cout<<"child";
angka else if (n<=27) cout<<"teen";
cout << "Masukkan dua angka: "; else if (n<=55) cout<<"adult";
cin >> angka1 >> angka2; else cout<<"sepuh";
}
// Melakukan perhitungan sesuai operator return 0;
switch (operasi) { }
case '+':
cout << "Hasil penjumlahan: " << angka1
+ angka2 << endl;
break;
case '-':
cout << "Hasil pengurangan: " << angka1
- angka2 << endl;
break;
default:
cout << "Operasi tidak valid" << endl;
break;
}

return 0;
}
#include <iostream> #include <iostream>
using namespace std; #include <string>

int main() { using namespace std;

int matrix[3][3]={{4, 9, 3},{5, 4, 7},{7, 6, 1}};
// Definisikan struktur Ponsel
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) struct tanding{
cout << matrix[i][j] <<"\t"; int tim1;
cout<<endl; int tim2;
} int skor1;
int skor2;
int sum1 = 0; };
int sum2 = 0;
int main() {
for (int i=0; i<3; i++) { int skor[5]={0,0,0,0,0};
sum1+=matrix[i][i]; //Diagonal pertama,
([0][0], [1][1], [2][2] -> [i][i]) int jumlah_tanding;
sum2+=matrix[i][2-i]; //Diagonal lainnya, cin>>jumlah_tanding;
([0][2], [1][1], [2][0] -> [i][2-i])
} tanding pertandingan[jumlah_tanding];

cout<<"Sum of the main diagonal: int point1, point2;

"<<sum1<<endl;
cout<<"Sum of the other diagonal: for (int i = 0; i < jumlah_tanding; i++) {
"<<sum2<<endl; cin>>pertandingan[i].tim1;
cin>>pertandingan[i].tim2;
return 0; cin>>pertandingan[i].skor1;
} cin>>pertandingan[i].skor2;

if(pertandingan[i].skor1>pertandingan[i].skor2){
skor[pertandingan[i].tim1-1]+=3;
}
else
if(pertandingan[i].skor2<pertandingan[i].skor1){
skor[pertandingan[i].tim2-1]+=3;
}
else {
skor[pertandingan[i].tim1-1]+=1;
skor[pertandingan[i].tim2-1]+=1;
}
}

int max = 0;
int top;
for(int i=0; i<5; i++){
cout<<skor[i]<<endl;
}

return 0;
 }

#include <iostream> #include <iostream>

using namespace std; using namespace std;

int main(){ int main(){

int bil; int n;
cout<<"Masukkan sebuah bilangan: "; cout<<"Masukkan nilai n: ";
cin>>bil; cin>>n;

int bil_reversed=0; // Bagian atas diamond

int sisa; for (int i=0; i<n; i++){

while (bil>0) { for (int j=n; j>i; j--){

sisa = bil%10; cout<<"*";
bil_reversed = bil_reversed*10+sisa; }
bil = bil/10;
} for (int k=0; k<2*i; k++){
cout<<" ";
cout<<"Bilangan yang sudah dibalik: }
"<<bil_reversed << endl;
for (int l=n; l>i; l--){
return 0; cout<<"*";
} }

cout<<endl;
}

for (int i=n-1; i>0; i--){

for (int j=n; j>=i; j--){

cout<<"*";
}

for (int k=0; k<2*i-2; k++){

cout<<" ";
}

for (int l=n; l>=i; l--){

cout<<"*";
}

cout<<endl;
}

return 0;
}
#include <iostream> #include<iostream>
#include <string> using namespace std;

using namespace std; int main(){

int bil;
// Definisikan struktur Ponsel bool isPrime = true;
struct ponsel {
string kode; cout<<"Masukkan angka: ";
string merk; cin>>bil;
int harga;
}; // Periksa jika bil kurang dari 2, bil bukan prima
if (bil<2){
struct ponsel_terjual{ isPrime = false;
string kode; }
int qty;
}; // Jika bilangan 2 atau lebih besar
else {
int main() { // lakukan iterasi untuk memeriksa apakah bil habis
int jumlah_ponsel = 4; dibagi 2 sampai bil/2
int jumlah_penjualan = 10; for(int i=2; i<=bil/2; i++){
if(bil%i==0){
int sum, total; isPrime=false;
break;
ponsel daftar_ponsel[jumlah_ponsel] = { }
{"SA", "Samsung", 1200}, }
{"VI", "Vivo", 900}, }
{"IP", "iPhone", 1100},
{"NO", "Nokia", 1500} return 0;
}; }

ponsel_terjual penjualan[10] = {
{"IP", 1},
{"IP", 4},
{"VI", 2},
{"NO", 1},
{"SA", 4},
{"IP", 2},
{"SA", 1},
{"VI", 3},
{"NO", 5},
{"IP", 1}
};

for (int i = 0; i < jumlah_ponsel; i++) {

sum = 0;
total = 0;
for (int j = 0; j<jumlah_penjualan; j++){
if (daftar_ponsel[i].kode ==
penjualan[j].kode){
sum+=penjualan[j].qty;
}
 }
total = sum*daftar_ponsel[i].harga;
cout<<"Jumlah penjualan
"<<daftar_ponsel[i].merk<<": "<<sum<<" unit.
Total: "<<total<<endl;
}

return 0;
}

#include <iostream> include <iostream>

#include<cmath> #include<cmath>
using namespace std; using namespace std;
struct Mhs{ struct Titik{
string NIM; double x,y;
string Nama; };
double IPK;
}; Titik T;
const int NMAX(50);
Mhs mhs[NMAX]; struct Garis{
Titik t1, t2;
int main() { };
int N(5);
mhs[0].NIM="10001"; Garis G;
mhs[0].Nama="Agung";
mhs[0].IPK=3.45; struct Segitiga{
Titik t1, t2, t3;
mhs[1].NIM="10002"; };
mhs[1].Nama="Johan";
mhs[1].IPK=3.4; Segitiga S;

mhs[2].NIM="10003"; int main() {

mhs[2].Nama="Linda"; T.x = 4;
mhs[2].IPK=2.45; T.y = 11;

mhs[3].NIM="10004"; G.t1.x = 2;
mhs[3].Nama="Puji"; G.t1.y = 7;
mhs[3].IPK=3.75; G.t2.x = 10;
G.t2.y = 9;
mhs[4].NIM="10005";
mhs[4].Nama="Bayu"; S.t1.x = 2;
mhs[4].IPK=1.45; S.t1.y = 0;
S.t2.x = 6;
double jumlah=0, rerata, ipkmax=0; S.t2.y = 5;
int imax=0; S.t3.x = 8;
S.t3.y = 3;
for(int i=0; i < N; i++){
jumlah += mhs[i].IPK; cout << "panjang G=" << sqrt(
if(ipkmax<mhs[i].IPK) { (G.t1.x-G.t2.x)*(G.t1.x-G.t2.x)+
ipkmax=mhs[i].IPK; (G.t1.y-G.t2.y)*(G.t1.y-G.t2.y)
imax=i; ) << endl;
 }
} cout << "keliling S=" <<
rerata=jumlah/N; sqrt(
cout << "ipk rerata=" << rerata << endl; (S.t1.x-S.t2.x)*(S.t1.x-S.t2.x)+
cout << "tertinggi=" << ipkmax << " yaitu: " << (S.t1.y-S.t2.y)*(S.t1.y-S.t2.y)
mhs[imax].Nama << endl; )+
sqrt(
return 0; (S.t3.x-S.t2.x)*(S.t3.x-S.t2.x)+
} (S.t3.y-S.t2.y)*(S.t3.y-S.t2.y)
)+
sqrt(
(S.t1.x-S.t3.x)*(S.t1.x-S.t3.x)+
(S.t1.y-S.t3.y)*(S.t1.y-S.t3.y)
)
<< endl;

return 0;
}

#include <iostream> #include <iostream>

#include<cmath> #include<cmath>
using namespace std; using namespace std;
struct Titik{ struct Titik{
double x,y; double x,y;
}; };
struct Segitiga{ const int NMAX(100);
Titik t[3]; struct Poligon{
}; Titik t[NMAX];
};
Segitiga S;
Poligon P;
int main() {
S.t[0].x = 2; int main() {
S.t[0].y = 0; int N;
S.t[1].x = 6; cout <<"jumlah titik=";
S.t[1].y = 5; cin >> N;
S.t[2].x = 8; for(int i=0; i<N; i++){
S.t[2].y = 3; cout << "titik ke:"<<i<<" ";
cin >> P.t[i].x >> P.t[i].y;
double keliling=0; }

for(int i=0; i < 3; i++){ double keliling=0;

keliling += sqrt(
(S.t[i].x-S.t[(i+1) % 3].x)*(S.t[i].x-S.t[(i+1) % for(int i=0; i < N; i++){
3].x)+ keliling += sqrt(
(S.t[i].y-S.t[(i+1) % 3].y)*(S.t[i].y-S.t[(i+1) % (P.t[i].x-P.t[(i+1) % N].x)*(P.t[i].x-P.t[(i+1) %
3].y) N].x)+
); (P.t[i].y-P.t[(i+1) % N].y)*(P.t[i].y-P.t[(i+1) %
} N].y)
cout << "keliling S=" << keliling << endl; );
}
 return 0; cout << "keliling P=" << keliling << endl;
}
return 0;
}
#include <iostream> #include<iostream> SANDGLASS
#include <conio.h> using namespace std;
using namespace std;
int main()
{
struct { int i, j, k, n;
int jam;
int menit; cout << " Ketik n = ";
int detik; cin >> n;
} masuk, keluar, selisih;
for(i = 0; i <= n - 1; i++)
int main() {
{ for(j = 0; j < i; j++){
//memasukan data 1 cout << " ";
cout <<"Masuk --------" <<endl; }
cout <<" Jam : "; cin >>masuk.jam; for(k = i; k <= n - 1; k++)
cout <<" Menit : "; cin >>masuk.menit; {
cout <<" Detik : "; cin >>masuk.detik; cout << "* ";
}
//membuat jarak baris cout << "\n";
cout <<endl <<endl; }

//memasukan data 2 for(i = n - 1; i >= 0; i--)

cout <<"Keluar --------" <<endl; {
cout <<" Jam : "; cin >>keluar.jam; for(j = 0; j < i; j++)
cout <<" Menit : "; cin >>keluar.menit; {
cout <<" Detik : "; cin >>keluar.detik; cout << " ";
}
for(k = i; k <= n - 1; k++)
//menghitung selisih detik {
if ((keluar.detik - masuk.detik) < 0) { cout << "* ";
selisih.detik = (60 + keluar.detik) - masuk.detik; }
keluar.menit; cout << "\n";
} }
else { return 0;
selisih.detik = keluar.detik - masuk.detik; }
}
//menghitung selisih menit
if ((keluar.menit- masuk.menit) < 0) {
selisih.menit= (60 + keluar.menit) -
masuk.menit;
keluar.jam;
}
else {
selisih.menit = keluar.menit- masuk.menit;
}
//menghitung selisih jam
selisih.jam = keluar.jam - masuk.jam;

//membuat jarak baris

cout <<endl <<endl;

cout <<" selisih dalam detik = " <<

selisih.jam*3600 + selisih.menit*60 +
selisih.detik <<endl;

cout<<endl<<endl;

cout <<"Selisih --------" <<endl;

cout <<" Jam : " << selisih.jam <<endl;
cout <<" Menit : " << selisih.menit <<endl;
cout <<" Detik : " << selisih.detik <<endl;

getch ();
return 0;
}
#include <iostream> BUTTERFLY #include <iostream>
using namespace std; using namespace std;

int main() int main() {

{ int n;
int n; std::cout << "Masukkan nilai n: ";
cout<<"ketik n="; std::cin >> n;
cin>>n;
for(int i=1;i<=n;i++){ int bintang = n * 2 - 1;
for(int j=1;j<=i;j++) { int spasi = 0;
cout<<" *";
} for (int i = 0; i < n; i++) {
int c=(2*n-2*i); for (int j = 0; j < spasi; j++) {
for(int j=1;j<=c;j++) { std::cout << ' ';
cout<<" "; }
} for (int j = 0; j < bintang; j++) {
for(int j=1;j<=i;j++) { std::cout << '*';
cout<<" *"; }
} std::cout << std::endl;
cout<<endl; bintang -= 2;
} spasi += 1;
for(int i=n;i>=1;i--){ }
for(int j=1;j<=i;j++) {
cout<<" *"; bintang = 1;
} spasi = n - 1;
int c=(2*n-2*i); for (int i = 0; i < n - 1; i++) {
for(int j=1;j<=c;j++) { for (int j = 0; j < spasi; j++) {
cout<<" "; cout << ' ';
} }
for(int j=1;j<=i;j++) { for (int j = 0; j < bintang; j++) {
cout<<" *"; cout << '*';
 } }
cout<<endl; cout << endl;
} bintang += 2;
return 0; spasi -= 1;
} }

return 0;
}

#include <iostream> #include <iostream>

using namespace std; #include <cmath> // Untuk fungsi sqrt
using namespace std;
int main(){
int n; int main() {
cout << "ketik n="; double x1, y1, x2, y2;
cin >> n;
for (int i=0; i<n; i++){ // Input koordinat titik pertama dan kedua
for (int j=0; j<n; j++){ cout << "Masukkan koordinat titik pertama
if(i==j || i+n==n-1 || i+n==n-3) (x1,y1): ";
cout << "*"; cin >> x1 >> y1;
else
cout << " "; cout << "Masukkan koordinat titik kedua
} (x2,y2): ";
cout << endl; cin >> x2 >> y2;
}
return 0; // Menghitung jarak
} double jarak = sqrt(pow(x2 - x1, 2) + pow(y2 -
y1, 2));

// Menampilkan hasil
cout << "Jarak antara kedua titik: " << jarak <<
std::endl;

return 0;
}
Difference between Interpreter and Compiler:

Interpreter:

An interpreter translates code line by line, executing each line immediately after translation.

Errors are often detected and reported one at a time, which can make debugging easier.

Slower execution since code is translated and executed simultaneously.

Examples: Python, Ruby, JavaScript interpreters.

Compiler:

A compiler translates the entire source code into machine code or an intermediate form before execution.

Errors are detected after the entire code is compiled, which may make debugging more challenging.

Faster execution since the entire code is optimized before execution.

Examples: GCC for C/C++, Java Compiler for Java, Microsoft Visual C# Compiler for C#.

Usage of Compiler:

Compilers are used to translate high-level programming languages (like C, C++, Java) into machine code or
intermediate code.

They perform code optimization to produce efficient and executable code.

Compilers are essential for developing standalone software applications and operating systems.

Why Include <iostream>:

<iostream> is a header file in C++ that provides input and output functionality.

You include it in your C++ program to use standard input/output streams like cin (for input) and cout (for
output).

It allows you to perform operations like reading from the keyboard and displaying information on the
console.

Examples of Compilers:

GCC (GNU Compiler Collection): Compiles C, C++, and various other languages.

Clang: A C, C++, and Objective-C compiler front end for the LLVM compiler infrastructure.

Microsoft Visual C++ Compiler: Used for C++ development on Windows.

Java Compiler (javac): Compiles Java source code into bytecode for the Java Virtual Machine (JVM).

Examples of Interpreters:

Python Interpreter: Executes Python scripts line by line.

Ruby Interpreter: Executes Ruby scripts interactively or from files.

JavaScript Interpreter: Used in web browsers to run JavaScript code.

PHP Interpreter: Executes PHP scripts for web development.

MATLAB Interpreter: Used for numerical computing and data analysis.

Algoritma: Cari dan Hitung Total untuk Angka 4

Inisialisasi variabel count dengan 0. Variabel ini akan digunakan untuk menghitung jumlah
kemunculan angka 4.

Inisialisasi variabel total dengan 0. Variabel ini akan digunakan untuk menghitung jumlah total dari
semua kemunculan angka 4.

Iterasi melalui setiap elemen x dalam data yang diberikan A.

Jika x sama dengan 4:

Tambahkan 1 ke count.

Tambahkan x ke total.

Setelah iterasi selesai, Anda akan memiliki jumlah kemunculan dalam count dan jumlah total dalam
total.

Tampilkan nilai count sebagai hasil dari jumlah kemunculan angka 4.

Tampilkan nilai total sebagai hasil dari jumlah total dari semua kemunculan angka 4.

Berikut adalah representasi flowchart sederhana dari algoritma tersebut:

# Function to perform addition #include<iostream>

def add(x, y): using namespace std;
return x + y
int main(){
# Function to perform subtraction int x(1), y(9);
def subtract(x, y): if ( x > 0) {
return x - y y = ++x + 1;
} else {
# Main program loop if ( y < x ){
while True: x =y--;
print("Options:") } else {
print("Enter 'add' for addition") if ( y > 0) {
print("Enter 'subtract' for subtraction") y %= x * 2 + 1;
print("Enter 'exit' to end the program") x += 100;
}
user_input = input(": ") }
}
if user_input == "exit": cout << "x=" << x << " y=" << y << endl;
break return 0;
elif user_input == "add": }
num1 = float(input("Enter first number: "))
num2 = float(input("Enter second number:
"))
result = add(num1, num2)
print("Result: " + str(result))
elif user_input == "subtract":
num1 = float(input("Enter first number: "))
num2 = float(input("Enter second number:
"))
result = subtract(num1, num2)
 print("Result: " + str(result))
else:
print("Invalid input. Please try again.")
# Input value x # Define the matrix
x = float(input("Enter a value between 0 and 80: matrix = [ [4],[5], [7],[9], [4],[6], [3],[7], [1]]
"))
# Task 1: Add elements of both diagonals
# Categorize the input based on the specified n = len(matrix) # Get the number of rows or
ranges columns (assuming it's a square matrix)
if 0 < x <= 5:
category = "toddler" # Initialize variables to store the sum of
elif 5 < x <= 17: diagonals
category = "child" sum_diagonal1 = 0
elif 17 < x <= 27: sum_diagonal2 = 0
category = "teen"
elif 27 < x <= 55: for i in range(n):
category = "adult" sum_diagonal1 += matrix[i][i] # Elements
elif 55 < x <= 80: of the main diagonal
category = "senior" sum_diagonal2 += matrix[i][n - i - 1] #
else: Elements of the secondary diagonal
category = "invalid"
# Display the sums of both diagonals
# Display the category print("Sum of the main diagonal:",
if category != "invalid": sum_diagonal1)
print(f"{x} belongs to the category: print("Sum of the secondary diagonal:",
{category}") sum_diagonal2)
else:
print("Invalid input. Please enter a value # Task 2: Search for the element 5
between 0 and 80.") element_to_search = 5
found = False

for i in range(n):
for j in range(n):
if matrix[i][j] == element_to_search:
print(f"Element {element_to_search}
found at position ({i + 1}, {j + 1})")
found = True

if not found:
print(f"Element {element_to_search} not
found in the matrix.")