📄 tut6.html

📁 Data Structure Ebook

💻 HTML

字号:

<HTML><HEAD>
<TITLE>Data Structures and Algorithms: Tutorial Problems 5</TITLE>

<META name="description" content="Data Structures and Algorithms Course Notes,
PLDS210 University of Western Australia">
<META name="keywords" content="data structures,algorithms,abstract data types ">
</HEAD>
<BODY BGCOLOR="#ffffff">
<TABLE BGCOLOR="#00c0f0" WIDTH="100%" CELLSPACING=0 CELLPADDING=0>
<TR BGCOLOR="#00f0f0"><TD ALIGN=right>
<FONT FACE=helvetica SIZE=+1><I>Data Structures and Algorithms</I></FONT>
</TD></TR>

<TR><TD><FONT FACE=helvetica SIZE=+2><B>Tutorial Problems: Part 5</B></FONT>
</TD></TR>
</TABLE>


<H4>Hard Problems</H4>
<OL>
<LI>I'm just about to depart on a sales trip to all of my company's
  customers. My company is paying for my air fares, so <I>I</I> don't 
  need to worry about the cost, but I'd really like to get the maximum
  number of frequent flyer points! 
  How long will it take for me to work out how to get a free flight to
  [Tahiti, Maldives, Santorini, Hawaii, Samoa <I>select one only</I>]?
  Assume that frequent flyer points are calculated simply on the distance
  between air ports. You need to determine a trip that will earn you
  the points necessary to get you a free flight to your chosen destination.
  Is this really a hard problem?

</OL> 
<P>

<TABLE CELLPADDING=5 WIDTH="100%" BGCOLOR="#00f0f0" CELLSPACING=4>
<TR><TD WIDTH=50%>
Continue on to <A HREF="tut7.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/Tutorials/tut7.html">Tutorials: Part 7</A></TD>
<TD>Back to the <A HREF="ds_ToC.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/ds_ToC.html">Table of Contents</A>
</TD></TR></TABLE>
<SMALL>
&copy; <A HREF=mailto:morris@ee.uwa.edu.au>John Morris</A>, 1998
</SMALL>
</BODY>
</HTML>

⌨️ 快捷键说明

复制代码 Ctrl + C

搜索代码 Ctrl + F

全屏模式 F11

切换主题 Ctrl + Shift + D

显示快捷键 ?

增大字号 Ctrl + =

减小字号 Ctrl + -