TweetFollow Us on Twitter

Nov 92 Challenge
Volume Number:8
Issue Number:7
Column Tag:Programmers' Challenge

Programmers' Challenge

By Mike Scanlin, MacTutor Regular Contributing Author

November 92 Programming Challenge of the Month

Millions of Colors?

Ever wonder how many of the 16,777,216 possible colors are really used in a typical 24-bit color image? Do you really need to run in 24-bit mode to appreciate certain images? Could some images be accurately represented as indexed color images instead, without any loss of color? Hmmm... The first thing you’d need to know is how many unique RGB values there are in the image, which would tell you how big your color lookup table would need to be. Let’s try it.

This month’s challenge is to quickly determine how many unique RGB values there are in a given 24-bit color image. The input to your function will be the dimensions and base address of an interleaved ARGB image:

unsigned long UniqueRGBValues(baseAddress, numRows, numCols)
PtrbaseAddress;
short   numRows, numCols;

The byte pointed to by baseAddress is the alpha byte of the upper left pixel. Following that are bytes for red, green and blue, which are then followed by the next set of ARGB values. You can ignore the alpha bytes completely when calculating unique RGB values. If you feel the need to allocate an array of 16,777,216 bits then, yes, you can assume your routine will have at least 2.5MBs free memory when called to do so (but remember that the time to initialize such an array is non-zero; there may be faster methods...).

Let’s say the maximum value for numCols is 640 and for numRows it’s 480. Your routine should be very fast for the average case but also be able to deal with the worst case where you have 640x480 unique RGB values.

We goofed

No two ways about it. In our rush to get the October issue out the door we were a little too hasty in determining the winner of the August MacTutor Challenge. Not more than 48 hours after the issue had gone to press (but before the stated challenge deadline had passed) we received a solution that was better than the one declared to be the winner. Our apologies to Greg Landweber (Princeton, NJ) who was the actual winner (and will also be receiving the prize). In order to prevent this from happening again in the future, we have moved the deadline up (see below).

The “deadline has now passed” winner of the “How many ways can you spell ‘CAT’” challenge is Will Galway (Salt Lake City, UT) whose entry was the only non-recursive one received. Take note recursion fanatics: Although recursion is a Good Thing conceptually (and in many cases practically), these monthly challenges are primarily about speed. We don’t need to contribute to the large body of existing slow code; we need faster code. Take a couple of No-Doze and study Will’s non-recursive alternative.

Thanks to Bob Barnhart (San Diego, CA) for his entertaining animated solution. Too bad it wasn’t as fast as it was fun to watch. Bob’s entry brings up another point as well: Please use a column width of 79 characters or less in your code. AppleLink (or the internet-AppleLink gateway, I’m not sure which) breaks lines longer than 80 characters and it’s a pain to manually fix them up when I get them. Thanks.

Here are Greg’s winning solution to the August Challenge (the real winner) and Will’s winning solution to the September Challenge (some comments have been removed for space reasons. The complete sources are on the source code disk):

Banded Pegs

/* Solution to the August 1992 MacTutor
 * Programmers' Challenge
 *
 * by Greg Landweber
 */

/* The number of holes in a row or column. */
#define max 13

void BandedPegs (numPegs, pegsPtr, numEdgePegsPtr,
 edgePegsPtr, areaPtr)
short numPegs;
Point *pegsPtr;
short *numEdgePegsPtr;
Point *edgePegsPtr;
Fixed *areaPtr;
{
 /* leftmost and rightmost peg in each row */
    short   xLeft[max],xRight[max];
 /* top and bottom rows containing pegs */
    short   top,bottom;
 /* horizontal and vertical coords. of peg */
    short   x,y;
 /* used to compute twice the enclosed area */
    short   area;
 /* number of pegs on left and right side */
    short   numLeft,numRight;
 /* array of pegs on left and right */
    Point   leftPegs[max],rightPegs[max];
 /* general use array index */
    short   index;
 /* for stepping through arrays of Points */
    Point   *pegPtr1,*pegPtr2;
 
/* Fill xLeft[v] and xRight[v] with the h-coords
 * of the leftmost and rightmost pegs in row v.
 * If there are no pegs in row v, then set
 *  xLeft[v]  = max, and
 *      xRight[v] = -1.
 * Note that any pegs inbetween the leftmost and
 * rightmost pegs in a row will automatically be
 * in the interior of the rubber band polygon.
 * This reduces the maximum number of pegs to 26.
 */
 
    for ( index = 0; index < max; index++ ) {
        xLeft [index] = max;
        xRight[index] = -1;
    }
 
    pegPtr1 = pegsPtr;
    for ( index = numPegs; index > 0; index-- ) {
        y = pegPtr1->v;
        x = pegPtr1->h;
        if ( x < xLeft [y] )
            xLeft [y] = x;
        if ( x > xRight[y] )
            xRight[y] = x;
        pegPtr1++;
    }
 
/* Find the bottom (lowest v) and top
 * (highest v) rows containing pegs. */

    bottom = -1;
    while ( xLeft [++bottom] == max );
 
    top = max;
    while ( xLeft [--top] == max );
 
/* Fill leftPegs[] with a list of all the pegs
 * on the left side of the convex polygon from
 * the top (hi v) to the bottom (lo v), and put
 * the number of those pegs - 1 in numLeft. */

 /* leftPegs[0] is the topmost (highest v) */
    leftPegs[0].h = xLeft[top];
 /* point on the left side of the polygon. */
    leftPegs[0].v = top;
 /* Index of the last peg in leftPegs[]. */
    numLeft = 0;
 
 /* Add pegs from the top to the bottom. */
    for (y = top - 1; y >= bottom; y--)
    /* Check if there is a peg in row y. */
        if ( (x = xLeft[y]) != max ) {
        /* Note thatpegPtr2 is the current
        * peg in the list and pegPtr1 is the
        * next. */ 
            pegPtr1 = leftPegs;
            pegPtr2 = pegPtr1++;
            for ( index = 0; index < numLeft; index++ )
            /* Is the peg at {x,y} to the left of
             * the line from *pegPtr1 to *pegPtr2? */
                if ( ( (x - pegPtr1->h) 
                    (pegPtr2->v - pegPtr1->v) ) <
                    ( (pegPtr2->h - pegPtr1->h) *
                    (y  - pegPtr1->v) ) )
                /* If so, all the pegs from pegPtr1 on
                 * will be to the right of the line
                 * from {x,y} to *pegPtr2, and so we
                 * remove them from the left peg list. */
                    numLeft = index;
                else
                /* If not, we go on to the next peg. */
                    pegPtr2 = pegPtr1++;
            /* Tack {x,y} onto the end of the list. */
            numLeft++;
            pegPtr1->v = y;
            pegPtr1->h = x;
        }

/* Fill rightPegs[] with a list of all the pegs
 * on the right side of the convex polygon from
 * the top (hi v) to the bottom (lo v), and put
 * the number of those pegs - 1 in numRight.
 */
 
 /* rightPegs[0] is the topmost (highest v)
  * point on the right side of the polygon. */
    rightPegs[0].h = xRight[top];
    rightPegs[0].v = top;

 /* Index of the last peg in rightPegs[]. */
    numRight = 0;

 /* Add pegs from the top to the bottom. */
    for (y = top - 1; y >= bottom; y--)
    /* Check if there is a peg in row y. */
        if ( (x = xRight[y]) != max ) { 
        /* Note that pegPtr2is the current peg */
        /* in the list and pegPtr1 is the next. */
            pegPtr1 = rightPegs;        
            pegPtr2 = pegPtr1++;        
            for ( index = 0; index < numRight; index++ )
            /* Is the peg at {x,y} to the right of
             * the line from *pegPtr1 to *pegPtr2?*/
                if ( ( (x - pegPtr1->h) *
                    (pegPtr2->v - pegPtr1->v) ) >
                    ( (pegPtr2->h - pegPtr1->h) *
                    (y - pegPtr1->v) ) )
               /* If so, all the pegs from pegPtr1 on
                * will be to the left of the line
                * from {x,y} to *pegPtr2, and so we
                * remove them from the right peg list. */
                    numRight = index;   
                else
                /* If not, we go on to the next peg.*/
                    pegPtr2 = pegPtr1++;
            numRight++;                 
            /* Tack {x,y} onto the end of the list. */
            pegPtr1->v = y;
            pegPtr1->h = x;
        }
 
/* Copy the contents of numLeft[] and
 * numRight[] into edgePegsPtr. */
    pegPtr2 = edgePegsPtr;

    pegPtr1 = leftPegs + 1;
    for ( index = numLeft - 1; index > 0; index-- )
        *(pegPtr2++) = *(pegPtr1++);

/* Do the pegs all lie on the same line?
 * If so, the left and right are the same.  */
    if ( *( (long *)leftPegs + 1 ) !=
        *( (long *)rightPegs + 1 ) ) {
        pegPtr1 = rightPegs + 1;
        for ( index = numRight - 1; index > 0; index-- )
            *(pegPtr2++) = *(pegPtr1++);
    }
 
/* Put all the pegs in the top and bottom
 * rows into edgePegsPtr. */
    pegPtr1 = pegsPtr;
    for ( index = numPegs; index > 0; index-- ) {
        if ( (pegPtr1->v == top) || (pegPtr1->v == bottom) )
            *(pegPtr2++) = *pegPtr1;
        pegPtr1++;
    }
 
/* Figure out how many pegs there are touching
 * the edge of the polygon. */
    *numEdgePegsPtr = pegPtr2 - edgePegsPtr;
 
/* Compute twice the area to the left of the
 * right side of the polygon. */
    area = 0;
 
/* The area of a trapezoid with height h and\
 * parallel sides of length a and b is h*(a+b)/2.
 * Here we have h = pegPtr2->v - pegPtr1->v,
 * a = pegPtr2->h, and  b = pegPtr1->h. */
    pegPtr1 = rightPegs;

/* Loop through all of the line segments on
 * the right side of the convex polygon. */        
    for ( index = numRight; index > 0; index-- ) {
        pegPtr2 = pegPtr1++;        
        area += (pegPtr2->v - pegPtr1->v) *
            (pegPtr2->h + pegPtr1->h);
    }
 
/* Subtract twice the area to the left of the
 * left side of the polygon. */
    pegPtr1 = leftPegs;             

/* Loop through all of the line segments on
 * the left side of the convex polygon. */
    for ( index = numLeft; index > 0; index-- ) {
        pegPtr2 = pegPtr1++;        
        area -= (pegPtr2->v - pegPtr1->v) *
            (pegPtr2->h + pegPtr1->h);
    }
 
/* Finally, divide by two and convert the
 * result to type Fixed. */
    *areaPtr = FixRatio( area, 2 );
}

How Many ways can you spell ’CAT‘

/* count-paths.h:  Declarations for count-paths.c
 *
 * Copyright (C) 1992,  William F. Galway
 *
 * Anyone can do what they like with this code,
 * as long as they acknowledge its author,
 * and include this message in their code.
 */
 
typedef int BOOL;
 
#define TRUE 1
#define FALSE 0
 
/* Possible target systems/compilers...  */
#define ThinkC 0
#define GnUnix 1
 
#if !defined(TARGET)
#define TARGET ThinkC
#endif
 
#if !defined(DEBUG)
#define DEBUG FALSE
#endif
 
#if !defined(VERBOSE)
#define VERBOSE FALSE
#endif
 
/* Maximum dimensions of the "matrix". */
#define MAXORDER 10
 
#if (TARGET==GnUnix)
/* This is the "Mac" StringPtr type.  The first
 * byte gives the length, the rest of the bytes
 * make up the string. */
typedef unsigned char Str255[256], *StringPtr;
 
/* Native is the type most naturally addressed,
 * roughly speaking...  */
typedef void Native;
#endif

#if (TARGET==ThinkC)
/* Native is the type most naturally addressed,
 * roughly speaking...  */
typedef char Native;
#endif
 
typedef struct locnode {
  /* Next node in list for a given character. */
    struct locnode *next;
} LocNode;
 
typedef struct {
    /* Number of entries per row...  */
    long dy;

    /* Vector of LocNodes indexed by
     * character code, giving first location
     * of character. */
    LocNode char_index[256];

    /* "Matrix" of LocNodes giving further
     * locations of each character. */
    LocNode index_matrix[(2+MAXORDER)*(2+MAXORDER)];
} Index;
 
/* BuildIndex builds up index for matrix of
 * given order. */
void BuildIndex(long order, const char *matrix,
 Index *index);
 
/* count_paths counts paths using previously
 * built index. */
long count_paths(const Index *index,
 const StringPtr word);
 
/* CountPaths is the "top level" path counting
 * routine. */
long CountPaths(short order, char *matrix,
 const StringPtr inputWordPtr);
 
/*-----------------------------------------*/
 
/* count-paths.c
 *
 * Copyright (C) 1992,  William F. Galway
 *
 * Anyone can do what they like with this code,
 * as long as they acknowledge its author,
 * and include this message in their code.
 */
 
/* The algorithm used by this implementation
 * avoids "combinatorial blowup" by working
 * backwards through the input word, keeping a
 * "count table" showing the number of paths for
 * the substring at each node.  For example, for
 * the string "CAR" we would get the following
 * counts (count tables) at each stage:
 *  -for "r":
 *     0  0  0
 *     0  1  0
 *     0  0  0
 *  -for "ar":
 *     0  0  0
 *     1  0  1
 *     0  1  0
 *  -for "car":
 *     1  0  1
 *     0  0  0
 *     0  0  2
 * giving a total of 4 solutions found at the
 * final stage. (This non-recursive approach is
 * reminiscent of the iterative versus the
 * recursive method of computing Fibonacci
 * numbers.)
 *
 * We actually keep two count tables around, one
 * giving counts for the "previous stage" (the
 * "previous table"), and one being built up for
 * the "current stage" (the "current table"). We
 * build the current table by locating occurrences
 * of the leading character of the substring, and
 * then summing the counts from the four
 * neighboring locations in the previous table. 
 * To ease the problem of dealing with the edges
 * of the tables, we allocate "dummy" rows and
 * columns at the edges of our count tables. The
 * counts at the edges always remain zero, while
 * the interesting stuff goes on in the interior
 * of the tables.
 *
 * To simplify (and speed up) the task of locating
 * occurrences of characters in the matrix, we
 * first build an "index" for the matrix which is
 * basically a linked list of pointers and then
 * index into the index (!) by the character that
 * we need the location(s) of. The index needs
 * building only once for a given matrix, after
 * which the count_paths routine may be called
 * (see how CountPaths invokes count_paths below).
 *
 * Other points to note:
 *
 *  -- Use of "Native" pointers for less "pointer
 *     arithmetic".
 *  -- The result returned by CountPaths is more
 *     properly interpreted as an unsigned long
 *     rather than as a signed long.
 *  -- These routines are not robust when called
 *     with matrices of order outside the range
 *     1..MAXORDER.
 */
 
#include "count-paths.h"
#include <stdio.h>
 
/* Build up index for matrix of given order.  */
void BuildIndex(long order, const char *matrix,
 Index *index)
{
    register unsigned char *chrp;
    register LocNode *spot, *spot2;
    long i,j;
 
    /* Zero out the char_index (256 entries).  */
    spot = index->char_index;
    spot2 = spot+256;
    do {
        (spot++)->next = NULL;
    } while (spot < spot2);
 
    /* Build up the index... The c'th entry in
     * char_index points to a chain of pointers
     * residing in index_matrix...  Note that
     * "edge" rows and columns are allowed to
     * contain nonsense. */

    spot = index->index_matrix+order+3;
    chrp = (unsigned char *)matrix;
    i = order;
    do {
        j = order;
        do {
            /* char_index[char] points to head of
             * chain for char. Set spot pointed at
             * to point to "next" spot with ch in
             * it (as previously stored in
             * char_index). */
            spot2 = &index->char_index[*chrp++];
            spot->next = spot2->next;
            spot2->next = spot++;
        } while (--j);

        /* Skip last & first columns of row. */
        spot += 2;
    } while (--i);
  
    index->dy = order+2;
 
    return;
}
 
/* Count paths using previously built index. */
long count_paths(const Index *index, const StringPtr word)
{
    register unsigned char *chrp;
    register long dyoffset;

    /* tbl_offset gives offset from "current
     * counts" table to "previous counts" table. 
     * i.e., previous_counts =
     * current_counts+tbl_offset. */
    long tbl_offset;

    /* current_offset, previous_offset give
     * offset from index->index_matrix to
     * current/previous count tables. */
    register long current_offset;
    register long previous_offset;
    LocNode *spot;
    long *countp;
    register long total;
    long count_tables[2*(2+MAXORDER)*(2+MAXORDER)];
 
    /* Point chrp to last char of word. */
    chrp = word + *word;
 
    /* Initialize misc offsets, pointers. */
    dyoffset = index->dy*sizeof(long);

    /* (short) avoids subroutine call for
     * multiply for some systems. */
    tbl_offset = (short)(index->dy)*(short)dyoffset;
    current_offset = (Native *)count_tables-
        (Native *)(index->index_matrix);
    previous_offset = tbl_offset+current_offset;
 
    /* Zero out the count tables. */
    countp=count_tables;
    do {
        *countp++ = 0;
    } while (countp < (long *)((Native *)
        count_tables+2*tbl_offset));
  
    total = 0;
 
    /* Initialize counts for "previous table".
     * (It will soon be previous!) */
    for (spot=(index->char_index)[*chrp].next;
        spot!=NULL; spot=spot->next) {
        *(long *)((Native *)spot+previous_offset) = 1;
        total++;
    }
 
    if (total==0 || --chrp<=word)
        return total;
 
    while (TRUE) {
        total = 0;
        for (spot=(index->char_index)[*chrp].next;
            spot!=NULL; spot=spot->next) {
            countp = (long *)((Native *)spot +
                previous_offset);

            /* Hairy expression avoids variable,
             * may free up register... */
            total += *(long *)((Native *)spot +
                current_offset) = *(countp-1) +
                *(countp+1) + *(long *)((Native *)
                countp-dyoffset) + *(long *)
                ((Native*)countp+dyoffset);
        }

        if (total==0 || --chrp<=word)
            return total;
 
      /* Swap "current" and "previous" count
       * tables. */
        current_offset += tbl_offset;
        previous_offset -= tbl_offset;
        tbl_offset = - tbl_offset;
         /* Zero out current counts, only need
         * touch non-zero entries. */
        for (spot=(index->char_index)[*(chrp+2)].next;
            spot!=NULL; spot=spot->next) {
            *(long *)((Native *)spot + current_offset) = 0;
        }
    }
}


long CountPaths(short order, char *matrix,
 const StringPtr inputWordPtr)
{
    long ord=order;
    Index index;
 
    /* Problem statement restricts word length to
     * be >0, but be paranoid since
     * count_paths(...) is not robust for 0 length
     * words. Return 0 if empty (zero length)
     * word. */
    if (*inputWordPtr == 0) {
        return 0;
    } else if (*inputWordPtr == 1) {
        /* Avoid work of building index, etc. for
         * length one words. */
        register char ch=(char)inputWordPtr[1];
        char *chrp = matrix;
        long total=0;
 
        do {
            if (ch == *chrp++) {
                total++;
            }
        } while (chrp < matrix+order*order);
        return total;
    } else {
        /* Invoke count_paths after building the
         * index... */
        BuildIndex(ord, matrix, &index);
        return count_paths(&index, inputWordPtr);
    }
}
 

Community Search:
MacTech Search:

Software Updates via MacUpdate

Bookends 12.8 - Reference management and...
Bookends is a full-featured bibliography/reference and information-management system for students and professionals. Bookends uses the cloud to sync reference libraries on all the Macs you use.... Read more
Apple iTunes 12.6 - Play Apple Music and...
Apple iTunes lets you organize and stream Apple Music, download and watch video and listen to Podcasts. It can automatically download new music, app, and book purchases across all your devices and... Read more
Default Folder X 5.1.4 - Enhances Open a...
Default Folder X attaches a toolbar to the right side of the Open and Save dialogs in any OS X-native application. The toolbar gives you fast access to various folders and commands. You just click on... Read more
Amazon Chime 4.1.5587 - Amazon-based com...
Amazon Chime is a communications service that transforms online meetings with a secure, easy-to-use application that you can trust. Amazon Chime works seamlessly across your devices so that you can... Read more
CrossOver 16.2 - Run Windows apps on you...
CrossOver can get your Windows productivity applications and PC games up and running on your Mac quickly and easily. CrossOver runs the Windows software that you need on Mac at home, in the office,... Read more
Adobe Creative Cloud 4.0.0.185 - Access...
Adobe Creative Cloud costs $19.99/month for a single app, or $49.99/month for the entire suite. Introducing Adobe Creative Cloud desktop applications, including Adobe Photoshop CC and Illustrator CC... Read more
MegaSeg 6.0.2 - Professional DJ and radi...
MegaSeg is a complete solution for pro audio/video DJ mixing, radio automation, and music scheduling with rock-solid performance and an easy-to-use design. Mix with visual waveforms and Magic... Read more
Bookends 12.8 - Reference management and...
Bookends is a full-featured bibliography/reference and information-management system for students and professionals. Bookends uses the cloud to sync reference libraries on all the Macs you use.... Read more
Adobe Creative Cloud 4.0.0.185 - Access...
Adobe Creative Cloud costs $19.99/month for a single app, or $49.99/month for the entire suite. Introducing Adobe Creative Cloud desktop applications, including Adobe Photoshop CC and Illustrator CC... Read more
Default Folder X 5.1.4 - Enhances Open a...
Default Folder X attaches a toolbar to the right side of the Open and Save dialogs in any OS X-native application. The toolbar gives you fast access to various folders and commands. You just click on... Read more

The best new games we played this week
It's been quite the week, but now that all of that business is out of the way, it's time to hunker down with some of the excellent games that were released over the past few days. There's a fair few to help you relax in your down time or if you're... | Read more »
Orphan Black: The Game (Games)
Orphan Black: The Game 1.0 Device: iOS Universal Category: Games Price: $4.99, Version: 1.0 (iTunes) Description: Dive into a dark and twisted puzzle-adventure that retells the pivotal events of Orphan Black. | Read more »
The Elder Scrolls: Legends is now availa...
| Read more »
Ticket to Earth beginner's guide: H...
Robot Circus launched Ticket to Earth as part of the App Store's indie games event last week. If you're not quite digging the space operatics Mass Effect: Andromeda is serving up, you'll be pleased to know that there's a surprising alternative on... | Read more »
Leap to victory in Nexx Studios new plat...
You’re always a hop, skip, and a jump away from a fiery death in Temple Jump, a new platformer-cum-endless runner from Nexx Studio. It’s out now on both iOS and Android if you’re an adventurer seeking treasure in a crumbling, pixel-laden temple. | Read more »
Failbetter Games details changes coming...
Sunless Sea, Failbetter Games' dark and gloomy sea explorer, sets sail for the iPad tomorrow. Ahead of the game's launch, Failbetter took to Twitter to discuss what will be different in the mobile version of the game. Many of the changes make... | Read more »
Splish, splash! The Pokémon GO Water Fes...
Niantic is back with a new festival for dedicated Pokémon GO collectors. The Water Festival officially kicks off today at 1 P.M. PDT and runs through March 29. Magikarp, Squirtle, Totodile, and their assorted evolved forms will be appearing at... | Read more »
Death Road to Canada (Games)
Death Road to Canada 1.0 Device: iOS Universal Category: Games Price: $7.99, Version: 1.0 (iTunes) Description: Get it now at the low launch price! Price will go up a dollar every major update. Update news at the bottom of this... | Read more »
Bean's Quest Beginner's Guide:...
Bean's Quest is a new take on both the classic platformer and the endless runner, and it's free on the App Store for the time being. Instead of running constantly, you can't stop jumping. That adds a surprising new level of challenge to the game... | Read more »
How to rake in the cash in Bit City
Our last Bit City guide covered the basics. Now it's time to get into some of the more advanced techniques. In the later cities, cash flow becomes much more difficult, so you'll want to develop some strategies if you want to complete each level.... | Read more »

Price Scanner via MacPrices.net

SSD Speeder RAM Disk SSD Life Extender App Fo...
Fehraltorf, Switzerland based B-Eng has announced they are making their SSD Speeder app for macOS publicly available for purchase on their website. SSD Speeder is a RAM disk utility that prevents... Read more
iPhone Scores Highest Overall in Smartphone D...
Customer satisfaction is much higher among smartphone owners who use their device to operate other connected home services such as smart thermostats and smart appliances, according to the J.D. Power... Read more
Swipe CRM Free Photo-Centric CRM Sales DEal C...
Swipe CRM LLC has introduced Swipe CRM: Visual Sales 1.0 for iPad, an app for creating, managing, and sharing visually stunning sales deals. Swipe CRM is targeted to small-and-medium creative... Read more
13-inch 2.0GHz Apple MacBook Pros on sale for...
B&H has the non-Touch Bar 13″ 2.0GHz MacBook Pros in stock today and on sale for $150 off MSRP. Shipping is free, and B&H charges NY sales tax only: - 13″ 2.0GHz MacBook Pro Space Gray (... Read more
15-inch Touch Bar MacBook Pros on sale for up...
B&H Photo has the new 2016 15″ Apple Touch Bar MacBook Pros in stock today and on sale for up to $150 off MSRP. Shipping is free, and B&H charges NY sales tax only: - 15″ 2.7GHz Touch Bar... Read more
Apple’s iPhone 6s Tops Best-Selling Smartphon...
In terms of shipments, the iPhone 6s from Apple bested all competitors for sales in 2016, according to new analysis from IHS Markit, a world leader in critical information, analytics and solutions.... Read more
Logitech Rugged Combo Protective iPad Case an...
Logitech has announced its Logitech Rugged Combo, Logitech Rugged Case, and Logitech Add-on Keyboard for Rugged Case for Apple’s new, more affordable $329 9.7-inch iPad, a complete solution designed... Read more
T-Mobile To Offer iPhone 7 and iPhone 7 Plus...
T-Mobile has announced it will offer iPhone 7 and iPhone 7 Plus (PRODUCT)RED Special Edition in a vibrant red aluminum finish. The introduction of this special edition iPhone celebrates Apple’s 10... Read more
9-inch 128GB iPad Pros on sale for $50-$70 of...
B&H Photo has 9.7″ 128GB Apple WiFi iPad Pros on sale for up to $70 off MSRP, each including free shipping. B&H charges sales tax in NY only: - 9″ Space Gray 128GB WiFi iPad Pro: $649 $50... Read more
27-inch iMacs on sale for up to $200 off MSRP...
B&H Photo has 27″ Apple iMacs on sale for up to $200 off MSRP, each including free shipping plus NY sales tax only: - 27″ 3.3GHz iMac 5K: $2099 $200 off MSRP - 27″ 3.2GHz/1TB Fusion iMac 5K: $... Read more

Jobs Board

*Apple* Retail - Multiple Positions- Chicago...
SalesSpecialist - Retail Customer Service and SalesTransform Apple Store visitors into loyal Apple customers. When customers enter the store, you're also the Read more
Fulltime aan de slag als shopmanager in een h...
Ben jij helemaal gek van Apple -producten en vind je het helemaal super om fulltime shopmanager te zijn in een jonge en hippe elektronicazaak? Wil jij werken in Read more
Starte Dein Karriere-Abenteuer in den Hauptst...
…mehrsprachigen Teams betreust Du Kunden von bekannten globale Marken wie Apple , Mercedes, Facebook, Expedia, und vielen anderen! Funktion Du wolltest schon Read more
*Apple* macOS Systems Integration Administra...
…most exceptional support available in the industry. SCI is seeking an Junior Apple macOS systems integration administrator that will be responsible for providing Read more
*Apple* Retail - Multiple Positions - Apple,...
Job Description: Sales Specialist - Retail Customer Service and Sales Transform Apple Store visitors into loyal Apple customers. When customers enter the store, Read more
All contents are Copyright 1984-2011 by Xplain Corporation. All rights reserved. Theme designed by Icreon.