Результаты поиска - "sorting algorithm"

Information science / по Luenberger, David G., 1937-

Предметы: “...Sorting algorithm....”
Полный текст

Numerical methods of statistics / по Monahan, John F.

Оглавление: “...Sorting Algorithms --...”
Полный текст

Java 9 data structures and algorithms : a step-by-step guide to data structures and algorithms / по Chawdhuri, Debasish Ray

Оглавление: “...Fold operation on a list -- Filter operation for a linked list -- Append on a linked list -- The flatMap method on a linked list -- The concept of a monad -- Option monad -- Try monad -- Analysis of the complexity of a recursive algorithm -- Performance of functional programming -- Summary -- Chapter 5: Efficient Searching -- Binary Search and Sorting -- Search algorithms -- Binary search -- Complexity of the binary search algorithm -- Sorting -- Selection sort -- Complexity of the selection sort algorithm -- Insertion sort -- Complexity of insertion sort -- Bubble sort -- Inversions -- Complexity of the bubble sort algorithm -- A problem with recursive calls -- Tail recursive functions -- Non-tail single recursive functions -- Summary -- Chapter 6: Efficient Sorting -- Quicksort and Merge Sort -- Quicksort -- Complexity of quicksort -- Random pivot selection in quicksort -- Merge sort -- The complexity of merge sort -- Avoiding the copying of tempArray -- Complexity of any comparison-based sorting -- The stability of a sorting algorithm -- Summary -- Chapter 7: Concepts of Tree -- A tree data structure -- The traversal of a tree -- The depth-first traversal -- The breadth-first traversal -- The tree abstract data type -- Binary tree -- Types of depth-first traversals -- Non-recursive depth-first search -- Summary -- Chapter 8: More About Search -- Search Trees and Hash Tables -- Binary search tree -- Insertion in a binary search tree -- Invariant of a binary search tree -- Deletion of an element from a binary search tree -- Complexity of the binary search tree operations -- Self-balancing binary search tree -- AVL tree -- Complexity of search, insert, and delete in an AVL tree -- Red-black tree -- Insertion -- Deletion -- The worst case of a red-black tree -- Hash tables -- Insertion -- The complexity of insertion -- Search -- Complexity of the search....”
Полный текст

My Revision Notes AQA A-Level Computer Science. по Reeves, Bob

Оглавление: “...14 Search algorithms -- binary, binary tree and linear search15 Reverse Polish Notation; 16 Sorting algorithms -- bubble and merge; Fundamentals of computational thinking; 17 Abstraction and automation; 18 Finite state machines; 19 The Turing machine; 20 Regular and context-free languages; 21 Maths for regular expressions; 22 Big O notation and classification of algorithms; Fundamentals of data representation; 23 Number systems; 24 Number bases; 25 The binary number system; 26 Coding systems; 27 Encryption; Fundamentals of computer systems; 28 Hardware and software....”
Полный текст

C# Data Structures and Algorithms : Explore the possibilities of C# for developing a variety of efficient applications. по Jamro, Marcin

Оглавление: “...Jagged arraysExample -- yearly transport plan; Sorting algorithms; Selection sort; Insertion sort; Bubble sort; Quicksort; Simple lists; Array list; Generic list; Example -- average value; Example -- list of people; Sorted lists; Example -- address book; Linked lists; Example -- book reader; Circular-linked lists; Implementation; Example -- spin the wheel; Summary; Chapter 3: Stacks and Queues; Stacks; Example -- reversing words; Example -- Tower of Hanoi; Queues; Example -- call center with a single consultant; Example -- call center with many consultants; Priority queues....”
Полный текст

Hands-On Data Structures and Algorithms with JavaScript : Write efficient code that is highly performant, scalable, and easily testable using JavaScript. по Mukkamala, Kashyap

Оглавление: “...Implementing the dynamic programming algorithm -- Using a greedy algorithm to build a travel itinerary -- Understanding spanning trees -- Pseudo code -- Implementing a minimum spanning tree using a greedy algorithm -- Using branch and bound algorithm to create a custom shopping list -- Understanding branch and bound algorithm -- Implementing branch and bound algorithm -- When not to use brute-force algorithm -- Brute-force Fibonacci generator -- Recursive Fibonacci generator -- Memoized Fibonacci generator -- Summary -- Chapter 7: Sorting and Its Applications -- Types of sorting algorithms -- Use cases of different sorting algorithms -- Creating an Express server -- Mocking library books data -- Insertionsort API -- What is Insertionsort -- Pseudo code -- Implementing Insertionsort API -- Mergesort API -- What is Mergesort -- Pseudo code -- Implementing Mergesort API -- Quicksort API -- What is Quicksort -- Pseudo code -- Implementing the Quicksort API -- Lomuto Partition Scheme -- Hoare Partition Scheme -- Performance comparison -- Summary -- Chapter 8: Big O Notation, Space, and Time Complexity -- Terminology -- Asymptotic Notations -- Big-O notation -- Omega notation -- Theta Notation -- Recap -- Examples of time complexity -- Constant time -- Logarithmic time -- Linear time -- Quadratic time -- Polynomial time -- Polynomial time complexity classes -- Recursion and additive complexity -- Space complexity and Auxiliary space -- Examples of Space complexity -- Constant space -- Linear space -- Summary -- Chapter 9: Micro-Optimizations and Memory Management -- Best practices -- Best practices for HTML -- Declaring the correct DOCTYPE -- Adding the correct meta-information to the page -- Dropping unnecessary attributes -- Making your app mobile ready -- Loading style sheets in the -- Avoiding inline styles -- Using semantic markup....”
Полный текст

Java 9 programming by example : your guide to software development / по Verhas, Peter

Оглавление: “...Cover -- Copyright -- Credits -- About the Author -- About the Reviewer -- www.PacktPub.com -- Customer Feedback -- Table of Contents -- Preface -- Chapter 1: Getting Started with Java 9 -- Getting started with Java -- Installing Java -- Installation on Windows -- Installation on MAC OS X -- Installation on Linux -- Setting JAVA_HOME -- Executing jshell -- Looking at the byte code -- Packaging classes into a JAR file -- Managing the running Java application -- Using an IDE -- NetBeans -- Eclipse -- IntelliJ -- IDE services -- IDE screen structure -- Editing files -- Managing projects -- Build the code and run it -- Debugging Java -- Summary -- Chapter 2: The First Real Java Program -- Sorting Names -- Getting started with sorting -- Bubble sort -- Getting started with project structure and build tools -- Make -- Ant -- Installing Ant -- Using Ant -- Maven -- Installing Maven -- Using Maven -- Gradle -- Installing Gradle -- Setting up the project with Maven -- Coding the sort -- Understanding the algorithm and language constructs -- Blocks -- Variables -- Types -- Arrays -- Expressions -- Loops -- Conditional execution -- Final variables -- Classes -- Inner, nested, local, and anonymous classes -- Packages -- Methods -- Interfaces -- Argument passing -- Fields -- Modifiers -- Object initializers and constructors -- Compiling and running the program -- Summary -- Chapter 3: Optimizing the Sort -- Making Code Professional -- The general sorting program -- A brief overview of various sorting algorithms -- Quick sort -- Project structure and build tools -- Maven dependency management -- Code the sort -- Creating the interfaces -- Creating BubbleSort -- Amending the interfaces -- Architectural considerations -- Creating unit tests -- Adding JUnit as dependency -- Writing the BubbleSortTest class -- Good unit tests -- A good unit test is readable....”
Полный текст