Explain line 6,7 and 9. What is arrPos + n?
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
Explain line 6,7 and 9. What is arrPos + n?
![1
#include<bits/stdc++.h>
2
using namespace std;
3\
int minSwaps(int arr[], int n){
4.
pair<int, int> arrPos[n];
for (int i = 0; i < n; i++){
arrPos[i].first
arr[i];
arrPos[i].second
i;
}
9.
sort(arrPos, arrPos + n);
10
vector<bool> vis(n, false);
11
int ans =
0;
12
for (int i = 0; i < n; i++){
if (vis[i] || arrPos[i].second
13
14
== i)
15
continue;
16
int cycle_size
0;
17
int j = i;
while (!vis[j]){
vis[j] = 1;
j = arrPos[j].second;
18
19
20
21
cycle_size++;
22
}
23
if (cycle_size > 0){
24
ans += (cycle_size - 1);
25
}
26
}
27
return ans;
}
int main(){
28
29
30
cout<<"Input:{1, 5, 4, 3, 2}<<endl;
31
int arr[] = {1, 5, 4, 3, 2};
int n =
(sizeof(arr) / sizeof(int));
33
cout «"Output: "« minSwaps(arr, n)<<" Steps"<<endl;
34
return 0;
35\
}
36
67
m m mm](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fc5344833-82c5-49c0-a51e-be3382d931b1%2F86e46d07-643e-4360-9a54-0b41e2b6a268%2Frot54gg_processed.png&w=3840&q=75)
Transcribed Image Text:1
#include<bits/stdc++.h>
2
using namespace std;
3\
int minSwaps(int arr[], int n){
4.
pair<int, int> arrPos[n];
for (int i = 0; i < n; i++){
arrPos[i].first
arr[i];
arrPos[i].second
i;
}
9.
sort(arrPos, arrPos + n);
10
vector<bool> vis(n, false);
11
int ans =
0;
12
for (int i = 0; i < n; i++){
if (vis[i] || arrPos[i].second
13
14
== i)
15
continue;
16
int cycle_size
0;
17
int j = i;
while (!vis[j]){
vis[j] = 1;
j = arrPos[j].second;
18
19
20
21
cycle_size++;
22
}
23
if (cycle_size > 0){
24
ans += (cycle_size - 1);
25
}
26
}
27
return ans;
}
int main(){
28
29
30
cout<<"Input:{1, 5, 4, 3, 2}<<endl;
31
int arr[] = {1, 5, 4, 3, 2};
int n =
(sizeof(arr) / sizeof(int));
33
cout «"Output: "« minSwaps(arr, n)<<" Steps"<<endl;
34
return 0;
35\
}
36
67
m m mm
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education