Scribd Logo
Upload

Welcome to Scribd!

  • Rezolvare Fisa Liste Ordonate - Neordonate

    Uploaded by

    ama
    25 views1 page
    This document outlines the contents of a course, including techniques of programming such as backtracking, greedy algorithms, divide and conquer, dynamic programming, and branch and bound. It also covers methods of sorting like selection sort, bubble sort, and insertion sort.

    Original Description:

    Original Title

    rezolvare fisa liste ordonate -neordonate.txt

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document outlines the contents of a course, including techniques of programming such as backtracking, greedy algorithms, divide and conquer, dynamic programming, and branch and bound. It also covers methods of sorting like selection sort, bubble sort, and insertion sort.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as txt, pdf, or txt
    25 views1 page

    Rezolvare Fisa Liste Ordonate - Neordonate

    Uploaded by

    ama
    This document outlines the contents of a course, including techniques of programming such as backtracking, greedy algorithms, divide and conquer, dynamic programming, and branch and bound. It also covers methods of sorting like selection sort, bubble sort, and insertion sort.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as txt, pdf, or txt
    of 1

    <html>

    <head>
    <title> Cuprinsul cursului </title> </head>
    <body bgcolor ="purple"> <img src="fluori.jpg" align="left" width="50" height="50"
    />

    <font color="orange">
    <ol type=I> <li>Tehnici de programare
    <ul type="circle">
    <font color="green">
    <li>Backtracking
    <li>Greedy
    <li>Divide et impera
    <li>Programare dinamica
    <li> Branch and bound

    </ul>
    </font>
    <li>Metode de sortare
    <font color="green">
    <ul type="circle">
    <li>Sortarea prin selectarea minimului
    <li>Sortarea prin interschimbare
    <li>Sortarea prin insertie
    </ul>
    </ol>
    </font>
    </body>
    </html>

    You might also like