Solutions Manual for Data Structures & Algorithm Analysis in C++ – 4th Edition (Mark Allen Weiss) | Data Structures & Algorithms Problem Solutions 2026/2027

??
??
??
??
47
s2
iu
en
dyg
tu

, Data Structures and Algorithm Analysis in C++
4th Edition
tu
Mark A. Weiss

4TH EDITION
d

TABLE OF CONTENTS
yg
PART ONE — INTRODUCTION

Chapter 1 Programming: A General Overview

Chapter 2 Algorithm Analysis
en

PART TWO — LINEAR STRUCTURES

Chapter 3 Lists, Stacks, and Queues

Chapter 4 Trees
iu

PART THREE — SORTING AND SELECTION

Chapter 5 Hashing
s2
Chapter 6 Priority Queues (Heaps)

Chapter 7 Sorting

PART FOUR — ADVANCED DATA STRUCTURES
47

Chapter 8 The Disjoint Sets Class

Chapter 9 Graph Algorithms

Chapter 10 Algorithm Design Techniques
??

Chapter 11 Amortized Analysis

Chapter 12 Advanced Data Structures and Implementation
??
APPENDICES

Appendix A Separate Compilation of Class Templates

Appendix B Handling Exceptions and Error Checking
??

Appendix C Standard Template Library (STL)



© 2014 Pearson Education, Inc. All rights reserved.
??

, CHAPTER 1
tu

Introduction
1.1
d
/*
Exercise 1.1
Selection of integers with k = N/2
select1 => sorting and selecting
yg

select2 => keeping top k
*/

#include <iostream>
#include <ctime>
en
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;
iu

void sort(vector<int> & vec)
{ // bubble sort ascending
bool sorted = false;
while (!sorted)
s2

{
sorted = true;
for (auto i = 1; i < vec.size(); i++)
{
if (vec[i-1]> vec[i])
47
{
swap(vec[i],vec[i-1]);
sorted = false;
}
}
}
??
}

void sortDec(vector<int> & vec)
{ // bubble sort descending
bool sorted = false;
??
while (!sorted)
{
sorted = true;
for (auto i = 1; i < vec.size(); i++)
{
if (vec[i-1]< vec[i])
??
{
swap(vec[i],vec[i-1]);
sorted = false;
}
}
??
}
}

, int select1(vector<int> nums)
{
int k = (nums.size()+1)/2;
tu
sort(nums);
return nums[k];
}
d
int select2(const vector<int> &nums)
{
int k = nums.size()/2;
yg
vector<int> topK(nums.begin(), nums.begin() + k);

sortDec(topK);
for (auto i = k; i < nums.size(); i++)
{
if (nums[i] > topK[k-1])
en

{
for (auto j = k-2; j >=0 ; j--)
if (nums[i] < topK[j])
{topK[j+1] = nums[i]; break;}
else
topK[j+1] = topK[j];
iu
if (topK[0] < nums[i])
topK[0] = nums[i];
}
}
s2
return topK[k-1];
}

int main()
{
vector<int> nums;
47

int selected;
time_t start, end;

srand(time(NULL));
for (auto numInts = 1000; numInts<=10000; numInts+=1000)
// sizes 1,000, 2,000, 3,000, ...10,000
??

{
nums.resize(numInts);

start = time(NULL);
for (auto i = 0; i < 10; i++) // run 10 times
??
{
for (auto j = 0; j < numInts; j++)
nums[j] = rand()%(2*numInts);
selected = select1(nums); // or selected = select2(nums);
}
??
end = time(NULL);
cout<<numInts<<"\t"<<difftime(end,start)<<endl;
}
return 0;
}
??